/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-simple/dll2n_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 17:23:43,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 17:23:43,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 17:23:43,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 17:23:43,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 17:23:43,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 17:23:43,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 17:23:43,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 17:23:43,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 17:23:43,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 17:23:43,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 17:23:43,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 17:23:43,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 17:23:43,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 17:23:43,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 17:23:43,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 17:23:43,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 17:23:43,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 17:23:43,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 17:23:43,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 17:23:43,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 17:23:43,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 17:23:43,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 17:23:43,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 17:23:43,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 17:23:43,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 17:23:43,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 17:23:43,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 17:23:43,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 17:23:43,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 17:23:43,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 17:23:43,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 17:23:43,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 17:23:43,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 17:23:43,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 17:23:43,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 17:23:43,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 17:23:43,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 17:23:43,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 17:23:43,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 17:23:43,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 17:23:43,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-12-23 17:23:43,516 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 17:23:43,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 17:23:43,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 17:23:43,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 17:23:43,523 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 17:23:43,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 17:23:43,523 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-23 17:23:43,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 17:23:43,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 17:23:43,524 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-23 17:23:43,526 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-23 17:23:43,526 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-23 17:23:43,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 17:23:43,527 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-23 17:23:43,527 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 17:23:43,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 17:23:43,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 17:23:43,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 17:23:43,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:23:43,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 17:23:43,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 17:23:43,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 17:23:43,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 17:23:43,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 17:23:43,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 17:23:44,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 17:23:44,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 17:23:44,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 17:23:44,077 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 17:23:44,078 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 17:23:44,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2020-12-23 17:23:44,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f187b8d7b/5ac16c4804a74141936f5367553355dc/FLAG80316d5d2 [2020-12-23 17:23:44,999 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 17:23:45,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2020-12-23 17:23:45,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f187b8d7b/5ac16c4804a74141936f5367553355dc/FLAG80316d5d2 [2020-12-23 17:23:45,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f187b8d7b/5ac16c4804a74141936f5367553355dc [2020-12-23 17:23:45,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 17:23:45,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 17:23:45,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 17:23:45,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 17:23:45,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 17:23:45,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:45,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb4eef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45, skipping insertion in model container [2020-12-23 17:23:45,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:45,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 17:23:45,272 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2020-12-23 17:23:45,654 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2020-12-23 17:23:45,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:23:45,692 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2020-12-23 17:23:45,753 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2020-12-23 17:23:45,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:23:45,853 INFO L208 MainTranslator]: Completed translation [2020-12-23 17:23:45,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45 WrapperNode [2020-12-23 17:23:45,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 17:23:45,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 17:23:45,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 17:23:45,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 17:23:45,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:45,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:45,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 17:23:45,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 17:23:45,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 17:23:46,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 17:23:46,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:46,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:46,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:46,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:46,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:46,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:46,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... [2020-12-23 17:23:46,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 17:23:46,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 17:23:46,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 17:23:46,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 17:23:46,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:23:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 17:23:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 17:23:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 17:23:46,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 17:23:47,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 17:23:47,175 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-23 17:23:47,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:23:47 BoogieIcfgContainer [2020-12-23 17:23:47,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 17:23:47,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 17:23:47,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 17:23:47,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 17:23:47,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 05:23:45" (1/3) ... [2020-12-23 17:23:47,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d983bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:23:47, skipping insertion in model container [2020-12-23 17:23:47,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:23:45" (2/3) ... [2020-12-23 17:23:47,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d983bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:23:47, skipping insertion in model container [2020-12-23 17:23:47,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:23:47" (3/3) ... [2020-12-23 17:23:47,189 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2020-12-23 17:23:47,197 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 17:23:47,204 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2020-12-23 17:23:47,226 INFO L253 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2020-12-23 17:23:47,254 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 17:23:47,255 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-23 17:23:47,255 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 17:23:47,255 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 17:23:47,255 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 17:23:47,255 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 17:23:47,255 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 17:23:47,256 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 17:23:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2020-12-23 17:23:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-23 17:23:47,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:47,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-23 17:23:47,286 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2020-12-23 17:23:47,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:47,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082086043] [2020-12-23 17:23:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:47,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082086043] [2020-12-23 17:23:47,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:47,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:23:47,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203175253] [2020-12-23 17:23:47,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:23:47,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:23:47,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:47,560 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2020-12-23 17:23:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:47,788 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2020-12-23 17:23:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:23:47,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-23 17:23:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:47,805 INFO L225 Difference]: With dead ends: 173 [2020-12-23 17:23:47,806 INFO L226 Difference]: Without dead ends: 168 [2020-12-23 17:23:47,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-12-23 17:23:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 92. [2020-12-23 17:23:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-12-23 17:23:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2020-12-23 17:23:47,863 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 5 [2020-12-23 17:23:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:47,864 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2020-12-23 17:23:47,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:23:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2020-12-23 17:23:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-23 17:23:47,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:47,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-23 17:23:47,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 17:23:47,866 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2020-12-23 17:23:47,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:47,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816265188] [2020-12-23 17:23:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:47,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816265188] [2020-12-23 17:23:47,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:47,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:23:47,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605955537] [2020-12-23 17:23:47,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:23:47,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:47,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:23:47,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:47,971 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 3 states. [2020-12-23 17:23:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:48,157 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2020-12-23 17:23:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:23:48,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-23 17:23:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:48,159 INFO L225 Difference]: With dead ends: 167 [2020-12-23 17:23:48,159 INFO L226 Difference]: Without dead ends: 167 [2020-12-23 17:23:48,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-12-23 17:23:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 89. [2020-12-23 17:23:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-23 17:23:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2020-12-23 17:23:48,171 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 5 [2020-12-23 17:23:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:48,171 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2020-12-23 17:23:48,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:23:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2020-12-23 17:23:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-23 17:23:48,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:48,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:48,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 17:23:48,173 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1809644651, now seen corresponding path program 1 times [2020-12-23 17:23:48,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:48,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104555185] [2020-12-23 17:23:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:48,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104555185] [2020-12-23 17:23:48,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:48,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:23:48,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350189908] [2020-12-23 17:23:48,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:23:48,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:23:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:48,214 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 3 states. [2020-12-23 17:23:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:48,225 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2020-12-23 17:23:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:23:48,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-23 17:23:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:48,227 INFO L225 Difference]: With dead ends: 99 [2020-12-23 17:23:48,227 INFO L226 Difference]: Without dead ends: 99 [2020-12-23 17:23:48,228 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 [2020-12-23 17:23:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-23 17:23:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2020-12-23 17:23:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-23 17:23:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2020-12-23 17:23:48,236 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 7 [2020-12-23 17:23:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:48,236 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2020-12-23 17:23:48,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:23:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2020-12-23 17:23:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 17:23:48,237 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:48,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:48,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 17:23:48,238 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 671668623, now seen corresponding path program 1 times [2020-12-23 17:23:48,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:48,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018655576] [2020-12-23 17:23:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:48,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018655576] [2020-12-23 17:23:48,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:48,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:23:48,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035259239] [2020-12-23 17:23:48,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:23:48,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:23:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:48,304 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 3 states. [2020-12-23 17:23:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:48,333 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2020-12-23 17:23:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:23:48,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-23 17:23:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:48,335 INFO L225 Difference]: With dead ends: 96 [2020-12-23 17:23:48,335 INFO L226 Difference]: Without dead ends: 96 [2020-12-23 17:23:48,336 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 [2020-12-23 17:23:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-23 17:23:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2020-12-23 17:23:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-23 17:23:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2020-12-23 17:23:48,343 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 9 [2020-12-23 17:23:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:48,343 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2020-12-23 17:23:48,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:23:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2020-12-23 17:23:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 17:23:48,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:48,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:48,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 17:23:48,345 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash -298497665, now seen corresponding path program 1 times [2020-12-23 17:23:48,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:48,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798020066] [2020-12-23 17:23:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:48,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798020066] [2020-12-23 17:23:48,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419821095] [2020-12-23 17:23:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:48,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 17:23:48,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:23:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:48,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:23:48,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 17:23:48,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166585461] [2020-12-23 17:23:48,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:23:48,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:23:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:48,582 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 5 states. [2020-12-23 17:23:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:48,602 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2020-12-23 17:23:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:23:48,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-23 17:23:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:48,604 INFO L225 Difference]: With dead ends: 97 [2020-12-23 17:23:48,605 INFO L226 Difference]: Without dead ends: 97 [2020-12-23 17:23:48,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-23 17:23:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-12-23 17:23:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-23 17:23:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2020-12-23 17:23:48,613 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 14 [2020-12-23 17:23:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:48,613 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2020-12-23 17:23:48,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:23:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2020-12-23 17:23:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 17:23:48,614 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:48,615 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:48,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:48,829 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466659, now seen corresponding path program 1 times [2020-12-23 17:23:48,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:48,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258964874] [2020-12-23 17:23:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:49,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258964874] [2020-12-23 17:23:49,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414492385] [2020-12-23 17:23:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:49,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 17:23:49,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:23:49,171 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:23:49,176 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:49,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:49,181 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:23:49,181 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 17:23:49,249 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:49,250 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 [2020-12-23 17:23:49,256 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:49,274 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-12-23 17:23:49,278 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:23:49,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-12-23 17:23:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:49,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:23:49,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-12-23 17:23:49,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345852858] [2020-12-23 17:23:49,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:23:49,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:23:49,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:49,304 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 5 states. [2020-12-23 17:23:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:49,476 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2020-12-23 17:23:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:23:49,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-23 17:23:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:49,478 INFO L225 Difference]: With dead ends: 108 [2020-12-23 17:23:49,478 INFO L226 Difference]: Without dead ends: 108 [2020-12-23 17:23:49,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:23:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-12-23 17:23:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2020-12-23 17:23:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-12-23 17:23:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2020-12-23 17:23:49,487 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 16 [2020-12-23 17:23:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:49,488 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2020-12-23 17:23:49,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:23:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2020-12-23 17:23:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 17:23:49,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:49,489 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:49,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:49,700 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466660, now seen corresponding path program 1 times [2020-12-23 17:23:49,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:49,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936824456] [2020-12-23 17:23:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:49,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936824456] [2020-12-23 17:23:49,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013985271] [2020-12-23 17:23:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:49,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 17:23:49,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:23:49,986 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:23:49,988 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:49,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:49,994 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:23:49,995 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:23:50,063 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:50,064 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 [2020-12-23 17:23:50,068 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:50,087 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-12-23 17:23:50,089 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:23:50,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-12-23 17:23:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:50,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:23:50,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 4 [2020-12-23 17:23:50,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204812924] [2020-12-23 17:23:50,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:23:50,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:23:50,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:50,118 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 5 states. [2020-12-23 17:23:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:50,249 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2020-12-23 17:23:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:23:50,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-23 17:23:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:50,251 INFO L225 Difference]: With dead ends: 95 [2020-12-23 17:23:50,251 INFO L226 Difference]: Without dead ends: 95 [2020-12-23 17:23:50,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:23:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-23 17:23:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-12-23 17:23:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-23 17:23:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2020-12-23 17:23:50,259 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 16 [2020-12-23 17:23:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:50,259 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2020-12-23 17:23:50,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:23:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2020-12-23 17:23:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 17:23:50,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:50,260 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:50,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:50,475 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1895030251, now seen corresponding path program 2 times [2020-12-23 17:23:50,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:50,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878728190] [2020-12-23 17:23:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:50,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878728190] [2020-12-23 17:23:50,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428811177] [2020-12-23 17:23:50,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:50,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 17:23:50,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:23:50,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 17:23:50,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:23:50,760 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:23:50,761 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:50,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:50,763 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:23:50,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 17:23:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 17:23:50,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 17:23:50,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2020-12-23 17:23:50,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460860362] [2020-12-23 17:23:50,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:23:50,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:23:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:50,777 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 3 states. [2020-12-23 17:23:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:50,865 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2020-12-23 17:23:50,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:23:50,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-23 17:23:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:50,867 INFO L225 Difference]: With dead ends: 104 [2020-12-23 17:23:50,868 INFO L226 Difference]: Without dead ends: 104 [2020-12-23 17:23:50,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-23 17:23:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2020-12-23 17:23:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-12-23 17:23:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2020-12-23 17:23:50,874 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 21 [2020-12-23 17:23:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:50,875 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2020-12-23 17:23:50,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:23:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2020-12-23 17:23:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 17:23:50,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:50,876 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:51,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:51,090 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1895030252, now seen corresponding path program 1 times [2020-12-23 17:23:51,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:51,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195889590] [2020-12-23 17:23:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:51,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195889590] [2020-12-23 17:23:51,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824824140] [2020-12-23 17:23:51,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:51,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 17:23:51,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:23:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:23:51,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:23:51,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 17:23:51,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082229986] [2020-12-23 17:23:51,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:23:51,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:51,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:23:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:23:51,364 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 4 states. [2020-12-23 17:23:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:51,418 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-12-23 17:23:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:23:51,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-23 17:23:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:51,423 INFO L225 Difference]: With dead ends: 92 [2020-12-23 17:23:51,423 INFO L226 Difference]: Without dead ends: 92 [2020-12-23 17:23:51,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-23 17:23:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-12-23 17:23:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-12-23 17:23:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2020-12-23 17:23:51,447 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 21 [2020-12-23 17:23:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:51,449 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2020-12-23 17:23:51,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:23:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2020-12-23 17:23:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 17:23:51,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:51,451 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:51,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:51,652 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:51,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1765778068, now seen corresponding path program 1 times [2020-12-23 17:23:51,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:51,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308932813] [2020-12-23 17:23:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 17:23:51,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308932813] [2020-12-23 17:23:51,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:51,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:23:51,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862845128] [2020-12-23 17:23:51,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:23:51,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:51,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:23:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:51,736 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 3 states. [2020-12-23 17:23:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:51,810 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-12-23 17:23:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:23:51,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-23 17:23:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:51,812 INFO L225 Difference]: With dead ends: 89 [2020-12-23 17:23:51,812 INFO L226 Difference]: Without dead ends: 89 [2020-12-23 17:23:51,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:23:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-23 17:23:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-12-23 17:23:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-23 17:23:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2020-12-23 17:23:51,828 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 22 [2020-12-23 17:23:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:51,831 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2020-12-23 17:23:51,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:23:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2020-12-23 17:23:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 17:23:51,832 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:51,833 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:51,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 17:23:51,833 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 199703601, now seen corresponding path program 1 times [2020-12-23 17:23:51,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:51,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441343503] [2020-12-23 17:23:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:23:52,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441343503] [2020-12-23 17:23:52,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541165796] [2020-12-23 17:23:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:52,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 17:23:52,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:23:52,162 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:23:52,163 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:52,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:52,166 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:23:52,167 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 17:23:52,188 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:52,189 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 [2020-12-23 17:23:52,192 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:52,224 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-12-23 17:23:52,225 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:23:52,225 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-12-23 17:23:52,280 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:52,281 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 [2020-12-23 17:23:52,287 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:52,302 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-12-23 17:23:52,306 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:23:52,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-12-23 17:23:52,354 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:52,355 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 [2020-12-23 17:23:52,360 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:52,379 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-12-23 17:23:52,382 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:23:52,382 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-12-23 17:23:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 17:23:52,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:23:52,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-12-23 17:23:52,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136206745] [2020-12-23 17:23:52,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 17:23:52,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 17:23:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:23:52,414 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 7 states. [2020-12-23 17:23:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:52,581 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2020-12-23 17:23:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:23:52,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-12-23 17:23:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:52,585 INFO L225 Difference]: With dead ends: 95 [2020-12-23 17:23:52,585 INFO L226 Difference]: Without dead ends: 95 [2020-12-23 17:23:52,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:23:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-23 17:23:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2020-12-23 17:23:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-23 17:23:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2020-12-23 17:23:52,593 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 27 [2020-12-23 17:23:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:52,593 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2020-12-23 17:23:52,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 17:23:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2020-12-23 17:23:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 17:23:52,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:52,596 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:52,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:52,811 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash 199703602, now seen corresponding path program 1 times [2020-12-23 17:23:52,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:52,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785694076] [2020-12-23 17:23:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 17:23:52,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785694076] [2020-12-23 17:23:52,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733481436] [2020-12-23 17:23:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:53,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 17:23:53,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:23:53,051 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:23:53,052 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:53,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:53,060 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:23:53,060 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-12-23 17:23:53,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:23:53,089 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-23 17:23:53,091 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:53,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:53,107 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:23:53,107 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2020-12-23 17:23:53,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:23:53,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:23:53,236 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:53,237 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2020-12-23 17:23:53,241 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:53,288 INFO L625 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2020-12-23 17:23:53,292 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:23:53,293 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:30 [2020-12-23 17:23:53,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:23:53,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:23:53,444 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:23:53,445 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2020-12-23 17:23:53,448 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:23:53,483 INFO L625 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2020-12-23 17:23:53,488 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:23:53,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2020-12-23 17:23:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 17:23:53,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 17:23:53,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2020-12-23 17:23:53,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647641182] [2020-12-23 17:23:53,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:23:53,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:23:53,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:23:53,586 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2020-12-23 17:23:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:53,749 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-12-23 17:23:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 17:23:53,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-23 17:23:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:53,750 INFO L225 Difference]: With dead ends: 77 [2020-12-23 17:23:53,751 INFO L226 Difference]: Without dead ends: 77 [2020-12-23 17:23:53,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:23:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-23 17:23:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-12-23 17:23:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-23 17:23:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-12-23 17:23:53,758 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2020-12-23 17:23:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:53,758 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-12-23 17:23:53,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:23:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-12-23 17:23:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 17:23:53,764 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:53,764 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:53,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:23:53,969 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:53,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:53,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1895844371, now seen corresponding path program 1 times [2020-12-23 17:23:53,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:53,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770631148] [2020-12-23 17:23:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 17:23:54,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770631148] [2020-12-23 17:23:54,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:54,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:23:54,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505829462] [2020-12-23 17:23:54,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:23:54,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:23:54,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:54,045 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2020-12-23 17:23:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:54,165 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2020-12-23 17:23:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:23:54,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-12-23 17:23:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:54,166 INFO L225 Difference]: With dead ends: 88 [2020-12-23 17:23:54,166 INFO L226 Difference]: Without dead ends: 88 [2020-12-23 17:23:54,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:23:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-23 17:23:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2020-12-23 17:23:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-23 17:23:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2020-12-23 17:23:54,170 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 28 [2020-12-23 17:23:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:54,171 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2020-12-23 17:23:54,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:23:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2020-12-23 17:23:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 17:23:54,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:54,172 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:54,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 17:23:54,172 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:54,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1895844372, now seen corresponding path program 1 times [2020-12-23 17:23:54,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:54,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322118955] [2020-12-23 17:23:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 17:23:54,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322118955] [2020-12-23 17:23:54,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:54,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:23:54,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266001634] [2020-12-23 17:23:54,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:23:54,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:23:54,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:23:54,248 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2020-12-23 17:23:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:54,357 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-12-23 17:23:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:23:54,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-12-23 17:23:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:54,359 INFO L225 Difference]: With dead ends: 75 [2020-12-23 17:23:54,359 INFO L226 Difference]: Without dead ends: 75 [2020-12-23 17:23:54,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:23:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-23 17:23:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-12-23 17:23:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-23 17:23:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-23 17:23:54,362 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 28 [2020-12-23 17:23:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:54,362 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-23 17:23:54,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:23:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-23 17:23:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 17:23:54,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:54,363 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:54,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 17:23:54,364 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:54,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1740473348, now seen corresponding path program 1 times [2020-12-23 17:23:54,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:54,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643547880] [2020-12-23 17:23:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:23:54,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643547880] [2020-12-23 17:23:54,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:54,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:23:54,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740392995] [2020-12-23 17:23:54,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:23:54,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:54,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:23:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:23:54,647 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2020-12-23 17:23:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:55,225 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2020-12-23 17:23:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 17:23:55,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-12-23 17:23:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:55,228 INFO L225 Difference]: With dead ends: 87 [2020-12-23 17:23:55,228 INFO L226 Difference]: Without dead ends: 87 [2020-12-23 17:23:55,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:23:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-23 17:23:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2020-12-23 17:23:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-23 17:23:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-12-23 17:23:55,235 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 33 [2020-12-23 17:23:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:55,237 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-12-23 17:23:55,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:23:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-12-23 17:23:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 17:23:55,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:55,239 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:55,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 17:23:55,240 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1740473347, now seen corresponding path program 1 times [2020-12-23 17:23:55,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:55,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894182858] [2020-12-23 17:23:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:23:55,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894182858] [2020-12-23 17:23:55,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:55,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:23:55,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695310829] [2020-12-23 17:23:55,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:23:55,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:55,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:23:55,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:23:55,541 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states. [2020-12-23 17:23:56,206 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2020-12-23 17:23:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:56,427 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2020-12-23 17:23:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 17:23:56,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-12-23 17:23:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:56,429 INFO L225 Difference]: With dead ends: 86 [2020-12-23 17:23:56,429 INFO L226 Difference]: Without dead ends: 86 [2020-12-23 17:23:56,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:23:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-12-23 17:23:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2020-12-23 17:23:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-23 17:23:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-23 17:23:56,433 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 33 [2020-12-23 17:23:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:56,433 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-23 17:23:56,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:23:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-23 17:23:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 17:23:56,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:56,434 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:56,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 17:23:56,435 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:56,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1843987096, now seen corresponding path program 1 times [2020-12-23 17:23:56,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:56,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194324149] [2020-12-23 17:23:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 17:23:56,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194324149] [2020-12-23 17:23:56,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:56,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 17:23:56,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611500391] [2020-12-23 17:23:56,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:23:56,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:23:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:23:56,587 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 8 states. [2020-12-23 17:23:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:56,889 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-12-23 17:23:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 17:23:56,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-12-23 17:23:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:56,891 INFO L225 Difference]: With dead ends: 73 [2020-12-23 17:23:56,891 INFO L226 Difference]: Without dead ends: 73 [2020-12-23 17:23:56,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-23 17:23:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-23 17:23:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-12-23 17:23:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-23 17:23:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2020-12-23 17:23:56,895 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 35 [2020-12-23 17:23:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:56,895 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2020-12-23 17:23:56,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:23:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2020-12-23 17:23:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 17:23:56,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:56,896 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:56,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 17:23:56,896 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1843987097, now seen corresponding path program 1 times [2020-12-23 17:23:56,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:56,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027711981] [2020-12-23 17:23:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 17:23:57,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027711981] [2020-12-23 17:23:57,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:57,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 17:23:57,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284148653] [2020-12-23 17:23:57,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 17:23:57,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:57,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 17:23:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:23:57,018 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 9 states. [2020-12-23 17:23:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:57,259 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2020-12-23 17:23:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 17:23:57,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-12-23 17:23:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:57,261 INFO L225 Difference]: With dead ends: 82 [2020-12-23 17:23:57,261 INFO L226 Difference]: Without dead ends: 82 [2020-12-23 17:23:57,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-23 17:23:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-23 17:23:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2020-12-23 17:23:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-23 17:23:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2020-12-23 17:23:57,264 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 35 [2020-12-23 17:23:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:57,264 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2020-12-23 17:23:57,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 17:23:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2020-12-23 17:23:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 17:23:57,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:57,265 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:57,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 17:23:57,265 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:57,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1749895302, now seen corresponding path program 1 times [2020-12-23 17:23:57,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:57,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201222153] [2020-12-23 17:23:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:23:57,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201222153] [2020-12-23 17:23:57,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:57,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:23:57,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462666299] [2020-12-23 17:23:57,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 17:23:57,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 17:23:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:23:57,502 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 11 states. [2020-12-23 17:23:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:57,971 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-12-23 17:23:57,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 17:23:57,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-12-23 17:23:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:57,972 INFO L225 Difference]: With dead ends: 68 [2020-12-23 17:23:57,972 INFO L226 Difference]: Without dead ends: 68 [2020-12-23 17:23:57,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-12-23 17:23:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-23 17:23:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-23 17:23:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-23 17:23:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-12-23 17:23:57,975 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 37 [2020-12-23 17:23:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:57,976 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-12-23 17:23:57,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 17:23:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-12-23 17:23:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 17:23:57,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:57,977 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:57,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 17:23:57,977 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:57,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1921787076, now seen corresponding path program 1 times [2020-12-23 17:23:57,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:57,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659684041] [2020-12-23 17:23:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:23:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 17:23:58,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659684041] [2020-12-23 17:23:58,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:23:58,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-23 17:23:58,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656874038] [2020-12-23 17:23:58,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 17:23:58,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:23:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 17:23:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-12-23 17:23:58,382 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2020-12-23 17:23:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:23:59,670 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2020-12-23 17:23:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 17:23:59,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-12-23 17:23:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:23:59,671 INFO L225 Difference]: With dead ends: 80 [2020-12-23 17:23:59,671 INFO L226 Difference]: Without dead ends: 80 [2020-12-23 17:23:59,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2020-12-23 17:23:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-23 17:23:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-12-23 17:23:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-23 17:23:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-12-23 17:23:59,675 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2020-12-23 17:23:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:23:59,675 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-12-23 17:23:59,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 17:23:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-12-23 17:23:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 17:23:59,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:23:59,676 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:23:59,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 17:23:59,677 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-23 17:23:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:23:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash -44591090, now seen corresponding path program 1 times [2020-12-23 17:23:59,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:23:59,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375023874] [2020-12-23 17:23:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:23:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:24:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:24:00,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375023874] [2020-12-23 17:24:00,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363448504] [2020-12-23 17:24:00,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:24:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:24:00,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-23 17:24:00,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:24:00,448 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:24:00,449 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:00,456 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,457 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-12-23 17:24:00,632 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:00,633 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 [2020-12-23 17:24:00,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:00,641 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:00,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,658 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2020-12-23 17:24:00,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:00,745 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2020-12-23 17:24:00,747 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:00,766 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,767 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2020-12-23 17:24:00,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:00,853 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-12-23 17:24:00,854 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2020-12-23 17:24:00,856 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:00,878 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:24:00,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2020-12-23 17:24:00,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:00,984 INFO L348 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2020-12-23 17:24:00,984 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2020-12-23 17:24:00,989 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:01,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:01,016 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:24:01,016 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:55 [2020-12-23 17:24:01,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:01,429 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:01,478 INFO L348 Elim1Store]: treesize reduction 12, result has 85.5 percent of original size [2020-12-23 17:24:01,478 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 102 [2020-12-23 17:24:01,483 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:01,570 INFO L625 ElimStorePlain]: treesize reduction 42, result has 66.9 percent of original size [2020-12-23 17:24:01,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,574 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:24:01,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:85 [2020-12-23 17:24:01,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:01,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:02,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:02,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:02,385 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-12-23 17:24:02,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 11, 1] term [2020-12-23 17:24:02,398 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:24:02,409 INFO L443 ElimStorePlain]: Different costs {20=[v_prenex_2, |v_#memory_$Pointer$.base_34|], 30=[v_prenex_4]} [2020-12-23 17:24:02,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:02,423 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:02,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:02,484 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:02,485 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 149 [2020-12-23 17:24:02,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:24:02,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:24:02,495 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:24:02,841 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2020-12-23 17:24:02,842 INFO L625 ElimStorePlain]: treesize reduction 26, result has 92.0 percent of original size [2020-12-23 17:24:02,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:02,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:02,856 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:02,930 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:02,931 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 149 [2020-12-23 17:24:02,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:24:02,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:24:02,941 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:24:03,347 WARN L197 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2020-12-23 17:24:03,348 INFO L625 ElimStorePlain]: treesize reduction 26, result has 92.6 percent of original size [2020-12-23 17:24:03,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:03,361 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:03,608 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-23 17:24:03,609 INFO L348 Elim1Store]: treesize reduction 12, result has 94.0 percent of original size [2020-12-23 17:24:03,609 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 219 [2020-12-23 17:24:03,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 3, 2, 1] term [2020-12-23 17:24:03,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-23 17:24:03,626 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:04,056 WARN L197 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2020-12-23 17:24:04,057 INFO L625 ElimStorePlain]: treesize reduction 54, result has 86.2 percent of original size [2020-12-23 17:24:04,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,066 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2020-12-23 17:24:04,067 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:271, output treesize:323 [2020-12-23 17:24:04,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,404 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-23 17:24:04,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,621 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:24:04,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:04,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:24:04,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:24:04,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:04,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,670 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:24:04,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:24:04,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-12-23 17:24:04,687 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:24:04,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:24:04,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:24:04,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:24:04,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:24:04,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:24:04,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:04,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:04,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:04,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:04,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:04,857 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_30|, v_prenex_14, v_prenex_8], 12=[v_prenex_6, |v_#memory_$Pointer$.base_35|], 20=[v_prenex_5, v_prenex_12], 42=[v_prenex_10]} [2020-12-23 17:24:04,919 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:24:04,920 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:04,971 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:24:04,993 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:06,605 WARN L197 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 159 DAG size of output: 159 [2020-12-23 17:24:06,606 INFO L625 ElimStorePlain]: treesize reduction 10, result has 98.5 percent of original size [2020-12-23 17:24:06,639 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:24:06,639 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:06,668 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:24:06,669 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:07,336 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-23 17:24:07,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:07,362 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:24:07,362 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:07,386 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:24:07,388 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:07,951 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-12-23 17:24:07,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:07,964 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:07,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:08,062 INFO L348 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2020-12-23 17:24:08,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 73 [2020-12-23 17:24:08,069 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:08,485 WARN L197 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-12-23 17:24:08,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:08,502 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:08,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:08,595 INFO L348 Elim1Store]: treesize reduction 54, result has 49.5 percent of original size [2020-12-23 17:24:08,595 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 79 [2020-12-23 17:24:08,601 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:08,951 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-12-23 17:24:08,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:08,963 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:08,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:09,150 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-12-23 17:24:09,151 INFO L348 Elim1Store]: treesize reduction 62, result has 67.7 percent of original size [2020-12-23 17:24:09,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 121 treesize of output 168 [2020-12-23 17:24:09,157 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:09,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:24:09,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:24:09,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:09,165 INFO L547 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:24:09,814 WARN L197 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2020-12-23 17:24:09,815 INFO L625 ElimStorePlain]: treesize reduction 21, result has 96.4 percent of original size [2020-12-23 17:24:09,827 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:09,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:09,987 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-23 17:24:09,988 INFO L348 Elim1Store]: treesize reduction 62, result has 67.7 percent of original size [2020-12-23 17:24:09,988 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 121 treesize of output 168 [2020-12-23 17:24:09,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:24:09,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:24:09,996 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:09,998 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:10,003 INFO L547 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:24:10,630 WARN L197 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-12-23 17:24:10,631 INFO L625 ElimStorePlain]: treesize reduction 21, result has 96.2 percent of original size [2020-12-23 17:24:10,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:10,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:10,673 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:10,742 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:10,743 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 144 [2020-12-23 17:24:10,749 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:10,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:10,769 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:10,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:24:10,856 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:10,856 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 184 [2020-12-23 17:24:10,863 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:11,448 WARN L197 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 104 [2020-12-23 17:24:11,449 INFO L625 ElimStorePlain]: treesize reduction 190, result has 72.5 percent of original size [2020-12-23 17:24:11,474 INFO L547 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 6 xjuncts. [2020-12-23 17:24:11,474 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 19 variables, input treesize:665, output treesize:573 [2020-12-23 17:24:40,143 WARN L197 SmtUtils]: Spent 28.40 s on a formula simplification. DAG size of input: 142 DAG size of output: 114 [2020-12-23 17:24:40,159 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 17:24:40,174 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 17:24:40,244 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:40,245 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:40,251 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2020-12-23 17:24:40,252 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:40,264 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:40,265 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:40,266 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2020-12-23 17:24:40,268 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:40,277 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:40,280 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:40,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2020-12-23 17:24:40,283 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:40,292 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:40,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2020-12-23 17:24:40,295 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:24:40,444 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-12-23 17:24:40,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:40,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2020-12-23 17:24:40,469 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:495, output treesize:406 [2020-12-23 17:24:42,861 WARN L197 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 124 [2020-12-23 17:24:45,311 WARN L197 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 124 [2020-12-23 17:24:45,415 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 17:24:45,481 INFO L443 ElimStorePlain]: Different costs {12=[v_prenex_26, v_prenex_30], 20=[|#memory_$Pointer$.base|], 30=[v_prenex_28]} [2020-12-23 17:24:45,574 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2020-12-23 17:24:45,575 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 109 [2020-12-23 17:24:45,578 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:45,580 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:45,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:24:45,583 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:45,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:24:45,587 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:24:45,695 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-23 17:24:45,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:45,785 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2020-12-23 17:24:45,786 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 109 [2020-12-23 17:24:45,791 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:45,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:24:45,792 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:45,794 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:45,797 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:24:45,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:46,048 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2020-12-23 17:24:46,049 INFO L348 Elim1Store]: treesize reduction 12, result has 91.5 percent of original size [2020-12-23 17:24:46,049 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 166 [2020-12-23 17:24:46,054 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:24:46,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:24:46,056 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:24:46,057 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:46,057 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,059 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:46,060 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,062 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:46,063 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,063 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,065 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:46,069 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:24:46,173 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-23 17:24:46,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:46,184 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:24:46,420 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2020-12-23 17:24:46,421 INFO L348 Elim1Store]: treesize reduction 44, result has 77.1 percent of original size [2020-12-23 17:24:46,425 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 181 [2020-12-23 17:24:46,431 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:24:46,432 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:24:46,433 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:24:46,434 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:46,435 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,436 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:46,438 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:46,439 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,440 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:46,440 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:24:46,442 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:46,443 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,444 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:46,446 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:46,447 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,448 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:46,450 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:24:46,451 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:24:46,452 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:24:46,453 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:24:46,453 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:24:46,457 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:24:46,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:24:46,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:46,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:46,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:46,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:24:46,559 INFO L547 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-12-23 17:24:46,559 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 22 variables, input treesize:430, output treesize:62 [2020-12-23 17:24:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:24:46,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 17:24:46,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [19] total 38 [2020-12-23 17:24:46,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667954496] [2020-12-23 17:24:46,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-23 17:24:46,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:24:46,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-23 17:24:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1377, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 17:24:46,839 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 21 states. [2020-12-23 17:24:48,677 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-12-23 17:24:49,193 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-12-23 17:24:49,759 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2020-12-23 17:25:50,601 WARN L197 SmtUtils]: Spent 1.01 m on a formula simplification. DAG size of input: 126 DAG size of output: 126 [2020-12-23 17:27:07,487 WARN L197 SmtUtils]: Spent 1.28 m on a formula simplification. DAG size of input: 219 DAG size of output: 219 [2020-12-23 17:28:14,292 WARN L197 SmtUtils]: Spent 1.11 m on a formula simplification. DAG size of input: 219 DAG size of output: 219