/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/list-ext-properties/test-0232_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:20:16,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:20:16,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:20:16,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:20:16,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:20:16,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:20:16,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:20:16,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:20:16,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:20:16,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:20:16,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:20:16,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:20:16,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:20:16,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:20:16,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:20:16,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:20:16,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:20:16,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:20:16,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:20:16,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:20:16,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:20:16,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:20:16,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:20:16,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:20:16,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:20:16,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:20:16,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:20:16,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:20:16,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:20:16,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:20:16,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:20:16,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:20:16,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:20:16,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:20:16,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:20:16,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:20:16,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:20:16,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:20:16,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:20:16,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:20:16,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:20:16,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:20:16,237 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:20:16,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:20:16,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:20:16,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:20:16,240 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:20:16,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:20:16,243 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:20:16,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:20:16,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:20:16,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:20:16,244 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:20:16,244 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:20:16,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:20:16,246 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:20:16,246 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:20:16,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:20:16,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:20:16,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:20:16,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:20:16,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:20:16,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:20:16,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:20:16,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:20:16,248 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:20:16,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 05:20:16,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:20:16,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:20:16,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:20:16,686 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:20:16,687 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:20:16,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-01-07 05:20:16,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82371d758/4aca31faf3ff44699b9be7668b397069/FLAGc63aad746 [2021-01-07 05:20:17,532 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:20:17,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-01-07 05:20:17,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82371d758/4aca31faf3ff44699b9be7668b397069/FLAGc63aad746 [2021-01-07 05:20:17,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82371d758/4aca31faf3ff44699b9be7668b397069 [2021-01-07 05:20:17,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:20:17,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:20:17,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:20:17,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:20:17,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:20:17,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:20:17" (1/1) ... [2021-01-07 05:20:17,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08ff85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:17, skipping insertion in model container [2021-01-07 05:20:17,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:20:17" (1/1) ... [2021-01-07 05:20:17,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:20:17,629 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],StructAccessExpression[IdentifierExpression[~item~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~item~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~plist,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-07 05:20:17,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:20:17,985 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],StructAccessExpression[IdentifierExpression[~item~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~item~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~plist,] left hand side expression in assignment: address: IdentifierExpression[~#list~0,] left hand side expression in assignment: address: IdentifierExpression[~#list~0,] [2021-01-07 05:20:18,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:20:18,133 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:20:18,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18 WrapperNode [2021-01-07 05:20:18,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:20:18,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:20:18,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:20:18,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:20:18,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:20:18,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:20:18,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:20:18,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:20:18,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... [2021-01-07 05:20:18,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:20:18,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:20:18,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:20:18,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:20:18,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:20:18,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:20:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:20:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:20:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:20:18,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:20:18,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 05:20:18,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:20:18,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:20:18,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:20:18,919 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:20:18,920 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-01-07 05:20:18,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:20:18 BoogieIcfgContainer [2021-01-07 05:20:18,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:20:18,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:20:18,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:20:18,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:20:18,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:20:17" (1/3) ... [2021-01-07 05:20:18,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bdc33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:20:18, skipping insertion in model container [2021-01-07 05:20:18,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:18" (2/3) ... [2021-01-07 05:20:18,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bdc33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:20:18, skipping insertion in model container [2021-01-07 05:20:18,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:20:18" (3/3) ... [2021-01-07 05:20:18,930 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2021-01-07 05:20:18,937 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:20:18,943 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2021-01-07 05:20:18,962 INFO L253 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2021-01-07 05:20:18,985 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:20:18,985 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:20:18,985 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:20:18,986 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:20:18,986 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:20:18,986 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:20:18,986 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:20:18,986 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:20:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2021-01-07 05:20:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:20:19,011 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:19,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:20:19,013 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2021-01-07 05:20:19,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:19,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603755457] [2021-01-07 05:20:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:19,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603755457] [2021-01-07 05:20:19,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:19,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:19,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024739664] [2021-01-07 05:20:19,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:19,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:19,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:19,354 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2021-01-07 05:20:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:19,559 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2021-01-07 05:20:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:19,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2021-01-07 05:20:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:19,573 INFO L225 Difference]: With dead ends: 116 [2021-01-07 05:20:19,573 INFO L226 Difference]: Without dead ends: 114 [2021-01-07 05:20:19,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-01-07 05:20:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2021-01-07 05:20:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:20:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-01-07 05:20:19,621 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 4 [2021-01-07 05:20:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:19,621 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-01-07 05:20:19,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-01-07 05:20:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:20:19,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:19,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:20:19,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:20:19,624 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:19,625 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2021-01-07 05:20:19,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:19,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699790595] [2021-01-07 05:20:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:19,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699790595] [2021-01-07 05:20:19,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:19,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:19,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047206384] [2021-01-07 05:20:19,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:19,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:19,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:19,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:19,734 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 4 states. [2021-01-07 05:20:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:20,055 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2021-01-07 05:20:20,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:20,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2021-01-07 05:20:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:20,058 INFO L225 Difference]: With dead ends: 195 [2021-01-07 05:20:20,058 INFO L226 Difference]: Without dead ends: 195 [2021-01-07 05:20:20,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-01-07 05:20:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 93. [2021-01-07 05:20:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:20:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2021-01-07 05:20:20,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 4 [2021-01-07 05:20:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:20,072 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-01-07 05:20:20,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2021-01-07 05:20:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:20:20,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:20,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:20:20,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:20:20,074 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2021-01-07 05:20:20,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:20,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149163326] [2021-01-07 05:20:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:20,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149163326] [2021-01-07 05:20:20,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:20,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:20,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534302077] [2021-01-07 05:20:20,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:20,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:20,156 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 3 states. [2021-01-07 05:20:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:20,248 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2021-01-07 05:20:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:20,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:20:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:20,253 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:20:20,254 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:20:20,255 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 [2021-01-07 05:20:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:20:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2021-01-07 05:20:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:20:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-01-07 05:20:20,277 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 5 [2021-01-07 05:20:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:20,278 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-01-07 05:20:20,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-01-07 05:20:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:20:20,278 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:20,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:20:20,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:20:20,281 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2021-01-07 05:20:20,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:20,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622663125] [2021-01-07 05:20:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:20,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622663125] [2021-01-07 05:20:20,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:20,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:20,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233888881] [2021-01-07 05:20:20,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:20,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:20,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:20,371 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2021-01-07 05:20:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:20,431 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-01-07 05:20:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:20,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:20:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:20,433 INFO L225 Difference]: With dead ends: 86 [2021-01-07 05:20:20,433 INFO L226 Difference]: Without dead ends: 86 [2021-01-07 05:20:20,434 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 [2021-01-07 05:20:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-01-07 05:20:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-01-07 05:20:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:20:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2021-01-07 05:20:20,446 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 5 [2021-01-07 05:20:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:20,447 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2021-01-07 05:20:20,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2021-01-07 05:20:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:20:20,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:20,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:20,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:20:20,449 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2021-01-07 05:20:20,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:20,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945053449] [2021-01-07 05:20:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:20,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945053449] [2021-01-07 05:20:20,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:20,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:20:20,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400484124] [2021-01-07 05:20:20,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:20:20,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:20:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:20:20,614 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2021-01-07 05:20:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:20,811 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2021-01-07 05:20:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:20:20,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2021-01-07 05:20:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:20,813 INFO L225 Difference]: With dead ends: 95 [2021-01-07 05:20:20,813 INFO L226 Difference]: Without dead ends: 95 [2021-01-07 05:20:20,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:20:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-01-07 05:20:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2021-01-07 05:20:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-07 05:20:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-01-07 05:20:20,819 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2021-01-07 05:20:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:20,819 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-01-07 05:20:20,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:20:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2021-01-07 05:20:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:20:20,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:20,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:20,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:20:20,821 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:20,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:20,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2021-01-07 05:20:20,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:20,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146998362] [2021-01-07 05:20:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:20,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146998362] [2021-01-07 05:20:20,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:20,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:20,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440394874] [2021-01-07 05:20:20,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:20,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:20,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:20,930 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 6 states. [2021-01-07 05:20:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,055 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2021-01-07 05:20:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:21,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-07 05:20:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,056 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:20:21,057 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:20:21,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:20:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:20:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2021-01-07 05:20:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:20:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2021-01-07 05:20:21,062 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 11 [2021-01-07 05:20:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,062 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2021-01-07 05:20:21,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2021-01-07 05:20:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:21,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:21,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:20:21,064 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2075089492, now seen corresponding path program 1 times [2021-01-07 05:20:21,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072898340] [2021-01-07 05:20:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:21,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072898340] [2021-01-07 05:20:21,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:21,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751659700] [2021-01-07 05:20:21,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:21,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:21,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:21,132 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 6 states. [2021-01-07 05:20:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,301 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2021-01-07 05:20:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:21,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-07 05:20:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,304 INFO L225 Difference]: With dead ends: 103 [2021-01-07 05:20:21,304 INFO L226 Difference]: Without dead ends: 103 [2021-01-07 05:20:21,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:20:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-07 05:20:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2021-01-07 05:20:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:20:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-01-07 05:20:21,310 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 18 [2021-01-07 05:20:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,310 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-01-07 05:20:21,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-01-07 05:20:21,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:21,311 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:21,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:20:21,312 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2075089493, now seen corresponding path program 1 times [2021-01-07 05:20:21,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907637014] [2021-01-07 05:20:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:21,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907637014] [2021-01-07 05:20:21,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:21,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888871009] [2021-01-07 05:20:21,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:21,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:21,409 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2021-01-07 05:20:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,559 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-01-07 05:20:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:21,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-07 05:20:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,560 INFO L225 Difference]: With dead ends: 98 [2021-01-07 05:20:21,560 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:20:21,561 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 [2021-01-07 05:20:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:20:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2021-01-07 05:20:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-07 05:20:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2021-01-07 05:20:21,565 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 18 [2021-01-07 05:20:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,565 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2021-01-07 05:20:21,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2021-01-07 05:20:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:21,566 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:21,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:20:21,567 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2075075558, now seen corresponding path program 1 times [2021-01-07 05:20:21,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954250634] [2021-01-07 05:20:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:21,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954250634] [2021-01-07 05:20:21,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:21,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300893288] [2021-01-07 05:20:21,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:21,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:21,628 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 3 states. [2021-01-07 05:20:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,639 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2021-01-07 05:20:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:21,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2021-01-07 05:20:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,641 INFO L225 Difference]: With dead ends: 68 [2021-01-07 05:20:21,641 INFO L226 Difference]: Without dead ends: 68 [2021-01-07 05:20:21,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-01-07 05:20:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-01-07 05:20:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-07 05:20:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-01-07 05:20:21,646 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 18 [2021-01-07 05:20:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,647 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-01-07 05:20:21,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-01-07 05:20:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:21,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:21,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:20:21,648 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2076311688, now seen corresponding path program 1 times [2021-01-07 05:20:21,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705908962] [2021-01-07 05:20:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:21,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705908962] [2021-01-07 05:20:21,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:21,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110172920] [2021-01-07 05:20:21,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:21,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:21,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:21,724 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 4 states. [2021-01-07 05:20:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,742 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2021-01-07 05:20:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:21,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-01-07 05:20:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,746 INFO L225 Difference]: With dead ends: 67 [2021-01-07 05:20:21,746 INFO L226 Difference]: Without dead ends: 67 [2021-01-07 05:20:21,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-07 05:20:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2021-01-07 05:20:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-01-07 05:20:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2021-01-07 05:20:21,750 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 18 [2021-01-07 05:20:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,750 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-01-07 05:20:21,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2021-01-07 05:20:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:20:21,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:21,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:20:21,752 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1526810556, now seen corresponding path program 1 times [2021-01-07 05:20:21,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426413551] [2021-01-07 05:20:21,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:21,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426413551] [2021-01-07 05:20:21,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:21,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717392339] [2021-01-07 05:20:21,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:21,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:21,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:21,831 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2021-01-07 05:20:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,915 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2021-01-07 05:20:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:21,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2021-01-07 05:20:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,917 INFO L225 Difference]: With dead ends: 62 [2021-01-07 05:20:21,917 INFO L226 Difference]: Without dead ends: 62 [2021-01-07 05:20:21,917 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 [2021-01-07 05:20:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-01-07 05:20:21,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-01-07 05:20:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-01-07 05:20:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-01-07 05:20:21,919 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 21 [2021-01-07 05:20:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,921 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-01-07 05:20:21,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-01-07 05:20:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:21,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,923 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] [2021-01-07 05:20:21,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:20:21,923 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash 86487093, now seen corresponding path program 1 times [2021-01-07 05:20:21,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503158728] [2021-01-07 05:20:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:21,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503158728] [2021-01-07 05:20:21,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:21,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716037986] [2021-01-07 05:20:21,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:21,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:21,983 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2021-01-07 05:20:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:22,088 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-01-07 05:20:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:22,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-07 05:20:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:22,090 INFO L225 Difference]: With dead ends: 61 [2021-01-07 05:20:22,090 INFO L226 Difference]: Without dead ends: 61 [2021-01-07 05:20:22,090 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 [2021-01-07 05:20:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-01-07 05:20:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-01-07 05:20:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-01-07 05:20:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-01-07 05:20:22,092 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 22 [2021-01-07 05:20:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:22,092 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-01-07 05:20:22,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-01-07 05:20:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:22,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:22,093 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:22,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:20:22,094 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2021-01-07 05:20:22,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:22,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724784158] [2021-01-07 05:20:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:22,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724784158] [2021-01-07 05:20:22,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244159442] [2021-01-07 05:20:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:22,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:20:22,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:22,450 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:22,451 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:22,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:22,462 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:22,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-01-07 05:20:22,579 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:22,580 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:20:22,585 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:22,614 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2021-01-07 05:20:22,617 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:22,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2021-01-07 05:20:22,670 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:22,671 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:22,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:22,686 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. [2021-01-07 05:20:22,687 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2021-01-07 05:20:22,776 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:22,776 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2021-01-07 05:20:22,780 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:22,809 INFO L625 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2021-01-07 05:20:22,811 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:22,812 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2021-01-07 05:20:22,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:22,990 INFO L348 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2021-01-07 05:20:22,991 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2021-01-07 05:20:22,994 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:23,019 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2021-01-07 05:20:23,025 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. [2021-01-07 05:20:23,026 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2021-01-07 05:20:23,125 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:23,126 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 28 treesize of output 24 [2021-01-07 05:20:23,128 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:23,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:23,139 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:23,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2021-01-07 05:20:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:23,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:23,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-01-07 05:20:23,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292345018] [2021-01-07 05:20:23,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:20:23,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:23,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:20:23,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:20:23,159 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 16 states. [2021-01-07 05:20:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:24,055 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2021-01-07 05:20:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:20:24,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-07 05:20:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:24,056 INFO L225 Difference]: With dead ends: 79 [2021-01-07 05:20:24,056 INFO L226 Difference]: Without dead ends: 79 [2021-01-07 05:20:24,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:20:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-01-07 05:20:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2021-01-07 05:20:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-07 05:20:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-01-07 05:20:24,059 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 22 [2021-01-07 05:20:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:24,059 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-01-07 05:20:24,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:20:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-01-07 05:20:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:24,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:24,060 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:24,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 05:20:24,268 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:24,269 INFO L82 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2021-01-07 05:20:24,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:24,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230593271] [2021-01-07 05:20:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:24,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230593271] [2021-01-07 05:20:24,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153518634] [2021-01-07 05:20:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:24,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 05:20:24,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:24,540 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:24,541 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:24,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:24,550 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:24,550 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-01-07 05:20:24,677 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:24,677 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:20:24,687 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:24,717 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2021-01-07 05:20:24,721 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:24,721 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2021-01-07 05:20:24,870 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:24,873 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:24,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:24,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:24,900 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:24,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:24,921 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. [2021-01-07 05:20:24,921 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:41 [2021-01-07 05:20:25,013 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:25,014 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2021-01-07 05:20:25,016 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:25,050 INFO L625 ElimStorePlain]: treesize reduction 26, result has 59.4 percent of original size [2021-01-07 05:20:25,052 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:25,052 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:38 [2021-01-07 05:20:25,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:25,175 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-01-07 05:20:25,176 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2021-01-07 05:20:25,177 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:25,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:25,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:25,218 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-01-07 05:20:25,219 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 21 [2021-01-07 05:20:25,223 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:25,241 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:25,247 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:25,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:57 [2021-01-07 05:20:25,356 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:25,356 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 28 treesize of output 24 [2021-01-07 05:20:25,358 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:25,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:25,383 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:25,383 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 33 treesize of output 25 [2021-01-07 05:20:25,385 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:25,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:25,397 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:25,397 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:71, output treesize:17 [2021-01-07 05:20:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:25,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:25,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2021-01-07 05:20:25,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431932397] [2021-01-07 05:20:25,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:20:25,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:25,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:20:25,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:20:25,444 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 19 states. [2021-01-07 05:20:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:26,883 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2021-01-07 05:20:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:20:26,884 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2021-01-07 05:20:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:26,884 INFO L225 Difference]: With dead ends: 81 [2021-01-07 05:20:26,885 INFO L226 Difference]: Without dead ends: 81 [2021-01-07 05:20:26,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:20:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-07 05:20:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2021-01-07 05:20:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-01-07 05:20:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-01-07 05:20:26,888 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 22 [2021-01-07 05:20:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:26,888 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-01-07 05:20:26,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:20:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-01-07 05:20:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:20:26,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:26,889 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] [2021-01-07 05:20:27,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:20:27,102 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1613867298, now seen corresponding path program 1 times [2021-01-07 05:20:27,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:27,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792712874] [2021-01-07 05:20:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:27,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792712874] [2021-01-07 05:20:27,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:27,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:27,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640064982] [2021-01-07 05:20:27,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:27,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:27,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:27,163 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2021-01-07 05:20:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:27,248 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2021-01-07 05:20:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:27,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-01-07 05:20:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:27,249 INFO L225 Difference]: With dead ends: 58 [2021-01-07 05:20:27,249 INFO L226 Difference]: Without dead ends: 58 [2021-01-07 05:20:27,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:20:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-07 05:20:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-01-07 05:20:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-01-07 05:20:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-01-07 05:20:27,252 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 23 [2021-01-07 05:20:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:27,252 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-01-07 05:20:27,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-01-07 05:20:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:20:27,253 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:27,253 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] [2021-01-07 05:20:27,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:20:27,253 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1509721432, now seen corresponding path program 1 times [2021-01-07 05:20:27,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:27,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495027750] [2021-01-07 05:20:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:27,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495027750] [2021-01-07 05:20:27,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:27,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:27,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553284325] [2021-01-07 05:20:27,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:27,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:27,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:27,340 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2021-01-07 05:20:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:27,472 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-01-07 05:20:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:27,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2021-01-07 05:20:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:27,473 INFO L225 Difference]: With dead ends: 57 [2021-01-07 05:20:27,474 INFO L226 Difference]: Without dead ends: 57 [2021-01-07 05:20:27,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:20:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-01-07 05:20:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-01-07 05:20:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-07 05:20:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-01-07 05:20:27,476 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 24 [2021-01-07 05:20:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:27,477 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-01-07 05:20:27,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-01-07 05:20:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:20:27,478 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:27,478 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] [2021-01-07 05:20:27,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:20:27,478 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1509721433, now seen corresponding path program 1 times [2021-01-07 05:20:27,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:27,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787216561] [2021-01-07 05:20:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:27,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787216561] [2021-01-07 05:20:27,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:27,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:27,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523574513] [2021-01-07 05:20:27,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:27,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:27,514 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 4 states. [2021-01-07 05:20:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:27,555 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2021-01-07 05:20:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:27,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-01-07 05:20:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:27,556 INFO L225 Difference]: With dead ends: 53 [2021-01-07 05:20:27,556 INFO L226 Difference]: Without dead ends: 53 [2021-01-07 05:20:27,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-01-07 05:20:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-01-07 05:20:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:20:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-01-07 05:20:27,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2021-01-07 05:20:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:27,559 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-01-07 05:20:27,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-01-07 05:20:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:20:27,559 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:27,560 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] [2021-01-07 05:20:27,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:20:27,560 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2021-01-07 05:20:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1394996802, now seen corresponding path program 1 times [2021-01-07 05:20:27,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:27,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396469583] [2021-01-07 05:20:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 05:20:27,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 05:20:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 05:20:27,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 05:20:27,653 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-07 05:20:27,655 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-07 05:20:27,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:20:27,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 05:20:27 BoogieIcfgContainer [2021-01-07 05:20:27,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 05:20:27,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 05:20:27,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 05:20:27,714 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 05:20:27,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:20:18" (3/4) ... [2021-01-07 05:20:27,718 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-07 05:20:27,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 05:20:27,719 INFO L168 Benchmark]: Toolchain (without parser) took 10151.83 ms. Allocated memory was 151.0 MB in the beginning and 223.3 MB in the end (delta: 72.4 MB). Free memory was 124.3 MB in the beginning and 99.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 98.3 MB. Max. memory is 8.0 GB. [2021-01-07 05:20:27,721 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:20:27,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.65 ms. Allocated memory is still 151.0 MB. Free memory was 124.1 MB in the beginning and 101.9 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:20:27,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.80 ms. Allocated memory is still 151.0 MB. Free memory was 101.8 MB in the beginning and 99.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:20:27,728 INFO L168 Benchmark]: Boogie Preprocessor took 34.40 ms. Allocated memory is still 151.0 MB. Free memory was 99.8 MB in the beginning and 98.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:20:27,728 INFO L168 Benchmark]: RCFGBuilder took 700.32 ms. Allocated memory is still 151.0 MB. Free memory was 98.3 MB in the beginning and 103.8 MB in the end (delta: -5.6 MB). Peak memory consumption was 6.5 MB. Max. memory is 8.0 GB. [2021-01-07 05:20:27,729 INFO L168 Benchmark]: TraceAbstraction took 8789.37 ms. Allocated memory was 151.0 MB in the beginning and 223.3 MB in the end (delta: 72.4 MB). Free memory was 103.3 MB in the beginning and 99.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 8.0 GB. [2021-01-07 05:20:27,729 INFO L168 Benchmark]: Witness Printer took 5.07 ms. Allocated memory is still 223.3 MB. Free memory is still 99.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:20:27,735 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 564.65 ms. Allocated memory is still 151.0 MB. Free memory was 124.1 MB in the beginning and 101.9 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 50.80 ms. Allocated memory is still 151.0 MB. Free memory was 101.8 MB in the beginning and 99.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.40 ms. Allocated memory is still 151.0 MB. Free memory was 99.8 MB in the beginning and 98.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 700.32 ms. Allocated memory is still 151.0 MB. Free memory was 98.3 MB in the beginning and 103.8 MB in the end (delta: -5.6 MB). Peak memory consumption was 6.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8789.37 ms. Allocated memory was 151.0 MB in the beginning and 223.3 MB in the end (delta: 72.4 MB). Free memory was 103.3 MB in the beginning and 99.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 8.0 GB. * Witness Printer took 5.07 ms. Allocated memory is still 223.3 MB. Free memory is still 99.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [c=0] [L531] c++ [L532] struct item *item = malloc(sizeof *item); VAL [c=1] [L533] EXPR \read(**plist) VAL [c=1] [L533] item->next = *plist VAL [c=1] [L534] EXPR item->next VAL [c=1] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L537] *plist = item VAL [c=1] [L545] length++ VAL [c=1] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [c=1] [L548] COND FALSE !(length < 0) VAL [c=1] [L551] EXPR \read(*list) VAL [c=1] [L551] EXPR list->next VAL [c=1] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [c=1] [L552] free(list) VAL [c=1] [L552] free(list) VAL [c=1] [L552] free(list) [L553] list = next VAL [c=1] [L554] length-- VAL [c=1] [L556] COND FALSE !(length > 0) VAL [c=1] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [c=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 44 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.6s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 783 SDtfs, 2091 SDslu, 1320 SDs, 0 SdLazy, 1879 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 248 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 294 ConstructedInterpolants, 20 QuantifiedInterpolants, 59099 SizeOfPredicates, 41 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 4/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...