/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-MemCleanup-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/heap-manipulation/tree-4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:55:10,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:55:10,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:55:10,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:55:10,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:55:10,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:55:10,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:55:10,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:55:10,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:55:10,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:55:10,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:55:10,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:55:10,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:55:10,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:55:10,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:55:10,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:55:10,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:55:10,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:55:10,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:55:10,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:55:10,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:55:10,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:55:10,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:55:10,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:55:10,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:55:10,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:55:10,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:55:10,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:55:10,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:55:10,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:55:10,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:55:10,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:55:10,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:55:10,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:55:10,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:55:10,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:55:10,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:55:10,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:55:10,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:55:10,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:55:10,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:55:10,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf [2021-01-07 04:55:10,766 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:55:10,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:55:10,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:55:10,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:55:10,771 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:55:10,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:55:10,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 04:55:10,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:55:10,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:55:10,772 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 04:55:10,773 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 04:55:10,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:55:10,774 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 04:55:10,774 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:55:10,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:55:10,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:55:10,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:55:10,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:55:10,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:55:10,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:55:10,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:55:10,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:55:10,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:55:10,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 04:55:11,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:55:11,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:55:11,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:55:11,271 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:55:11,272 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:55:11,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-4.i [2021-01-07 04:55:11,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7c899d7a9/3dec406f65ce4b138425063a4d86584d/FLAG19cc52f2a [2021-01-07 04:55:12,065 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:55:12,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i [2021-01-07 04:55:12,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7c899d7a9/3dec406f65ce4b138425063a4d86584d/FLAG19cc52f2a [2021-01-07 04:55:12,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7c899d7a9/3dec406f65ce4b138425063a4d86584d [2021-01-07 04:55:12,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:55:12,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:55:12,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:55:12,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:55:12,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:55:12,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:55:12" (1/1) ... [2021-01-07 04:55:12,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c43cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:12, skipping insertion in model container [2021-01-07 04:55:12,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:55:12" (1/1) ... [2021-01-07 04:55:12,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:55:12,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:55:12,890 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/heap-manipulation/tree-4.i[22626,22639] left hand side expression in assignment: lhs: VariableLHS[~node,] left hand side expression in assignment: lhs: VariableLHS[~node~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],StructAccessExpression[IdentifierExpression[~node~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nodelast~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~nodelast~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~nodelast~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],StructAccessExpression[IdentifierExpression[~node~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem16,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem16,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~node~0,] left hand side expression in assignment: lhs: VariableLHS[~node,] left hand side expression in assignment: lhs: VariableLHS[~last~0,] left hand side expression in assignment: lhs: VariableLHS[~node,] [2021-01-07 04:55:12,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:55:12,965 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:55:13,011 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/heap-manipulation/tree-4.i[22626,22639] left hand side expression in assignment: lhs: VariableLHS[~node,] left hand side expression in assignment: lhs: VariableLHS[~node~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],StructAccessExpression[IdentifierExpression[~node~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nodelast~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~nodelast~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~nodelast~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],StructAccessExpression[IdentifierExpression[~node~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem16,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem16,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~node~0,] left hand side expression in assignment: lhs: VariableLHS[~node,] left hand side expression in assignment: lhs: VariableLHS[~last~0,] left hand side expression in assignment: lhs: VariableLHS[~node,] [2021-01-07 04:55:13,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:55:13,107 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:55:13,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13 WrapperNode [2021-01-07 04:55:13,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:55:13,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:55:13,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:55:13,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:55:13,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:55:13,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:55:13,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:55:13,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:55:13,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... [2021-01-07 04:55:13,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:55:13,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:55:13,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:55:13,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:55:13,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:55:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:55:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:55:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:55:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:55:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:55:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:55:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:55:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:55:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:55:13,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:55:14,332 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:55:14,332 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-01-07 04:55:14,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:55:14 BoogieIcfgContainer [2021-01-07 04:55:14,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:55:14,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:55:14,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:55:14,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:55:14,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:55:12" (1/3) ... [2021-01-07 04:55:14,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15882aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:55:14, skipping insertion in model container [2021-01-07 04:55:14,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:13" (2/3) ... [2021-01-07 04:55:14,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15882aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:55:14, skipping insertion in model container [2021-01-07 04:55:14,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:55:14" (3/3) ... [2021-01-07 04:55:14,344 INFO L111 eAbstractionObserver]: Analyzing ICFG tree-4.i [2021-01-07 04:55:14,350 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:55:14,356 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2021-01-07 04:55:14,377 INFO L253 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2021-01-07 04:55:14,401 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:55:14,401 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 04:55:14,401 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:55:14,401 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:55:14,401 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:55:14,402 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:55:14,402 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:55:14,402 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:55:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2021-01-07 04:55:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 04:55:14,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:14,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 04:55:14,433 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:14,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash 28728583, now seen corresponding path program 1 times [2021-01-07 04:55:14,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:14,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761718394] [2021-01-07 04:55:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:14,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761718394] [2021-01-07 04:55:14,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:14,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:14,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725529955] [2021-01-07 04:55:14,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:55:14,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:55:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:55:14,637 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 2 states. [2021-01-07 04:55:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:14,661 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2021-01-07 04:55:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:55:14,663 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2021-01-07 04:55:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:14,674 INFO L225 Difference]: With dead ends: 147 [2021-01-07 04:55:14,674 INFO L226 Difference]: Without dead ends: 145 [2021-01-07 04:55:14,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:55:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-01-07 04:55:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-01-07 04:55:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-01-07 04:55:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2021-01-07 04:55:14,726 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 5 [2021-01-07 04:55:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:14,727 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2021-01-07 04:55:14,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:55:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2021-01-07 04:55:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-07 04:55:14,728 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:14,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-07 04:55:14,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:55:14,729 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash 889570280, now seen corresponding path program 1 times [2021-01-07 04:55:14,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:14,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820386674] [2021-01-07 04:55:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:14,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820386674] [2021-01-07 04:55:14,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:14,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:55:14,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856011328] [2021-01-07 04:55:14,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:14,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:14,793 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 3 states. [2021-01-07 04:55:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:14,966 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2021-01-07 04:55:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:14,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-01-07 04:55:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:14,969 INFO L225 Difference]: With dead ends: 149 [2021-01-07 04:55:14,969 INFO L226 Difference]: Without dead ends: 149 [2021-01-07 04:55:14,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-01-07 04:55:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-01-07 04:55:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2021-01-07 04:55:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2021-01-07 04:55:15,005 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 6 [2021-01-07 04:55:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:15,005 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2021-01-07 04:55:15,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2021-01-07 04:55:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-07 04:55:15,006 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:15,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-07 04:55:15,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:55:15,010 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:15,012 INFO L82 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2021-01-07 04:55:15,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:15,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903699933] [2021-01-07 04:55:15,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:15,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903699933] [2021-01-07 04:55:15,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:15,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:15,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656946335] [2021-01-07 04:55:15,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:15,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:15,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:15,133 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 3 states. [2021-01-07 04:55:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:15,423 INFO L93 Difference]: Finished difference Result 227 states and 245 transitions. [2021-01-07 04:55:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:15,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-01-07 04:55:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:15,426 INFO L225 Difference]: With dead ends: 227 [2021-01-07 04:55:15,426 INFO L226 Difference]: Without dead ends: 227 [2021-01-07 04:55:15,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-01-07 04:55:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 142. [2021-01-07 04:55:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-07 04:55:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2021-01-07 04:55:15,441 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 6 [2021-01-07 04:55:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:15,442 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2021-01-07 04:55:15,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2021-01-07 04:55:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-07 04:55:15,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:15,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-07 04:55:15,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 04:55:15,444 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2021-01-07 04:55:15,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:15,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317340635] [2021-01-07 04:55:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:15,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317340635] [2021-01-07 04:55:15,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:15,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:15,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903888881] [2021-01-07 04:55:15,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:15,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:15,522 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 3 states. [2021-01-07 04:55:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:15,726 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2021-01-07 04:55:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:15,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-01-07 04:55:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:15,728 INFO L225 Difference]: With dead ends: 246 [2021-01-07 04:55:15,728 INFO L226 Difference]: Without dead ends: 246 [2021-01-07 04:55:15,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-01-07 04:55:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 152. [2021-01-07 04:55:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-01-07 04:55:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2021-01-07 04:55:15,741 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 6 [2021-01-07 04:55:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:15,741 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2021-01-07 04:55:15,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2021-01-07 04:55:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 04:55:15,742 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:15,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:15,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 04:55:15,743 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1271536046, now seen corresponding path program 1 times [2021-01-07 04:55:15,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:15,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023316838] [2021-01-07 04:55:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:15,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023316838] [2021-01-07 04:55:15,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:15,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:55:15,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680984805] [2021-01-07 04:55:15,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:15,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:15,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:15,810 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 3 states. [2021-01-07 04:55:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:15,830 INFO L93 Difference]: Finished difference Result 244 states and 270 transitions. [2021-01-07 04:55:15,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:15,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-07 04:55:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:15,832 INFO L225 Difference]: With dead ends: 244 [2021-01-07 04:55:15,833 INFO L226 Difference]: Without dead ends: 244 [2021-01-07 04:55:15,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-01-07 04:55:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 156. [2021-01-07 04:55:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-01-07 04:55:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2021-01-07 04:55:15,843 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 9 [2021-01-07 04:55:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:15,843 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2021-01-07 04:55:15,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2021-01-07 04:55:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 04:55:15,844 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:15,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:15,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 04:55:15,845 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:15,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash -59301724, now seen corresponding path program 1 times [2021-01-07 04:55:15,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:15,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149180894] [2021-01-07 04:55:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:15,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149180894] [2021-01-07 04:55:15,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:15,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:15,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393408983] [2021-01-07 04:55:15,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:15,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:15,892 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 3 states. [2021-01-07 04:55:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:16,042 INFO L93 Difference]: Finished difference Result 239 states and 265 transitions. [2021-01-07 04:55:16,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:16,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-07 04:55:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:16,046 INFO L225 Difference]: With dead ends: 239 [2021-01-07 04:55:16,046 INFO L226 Difference]: Without dead ends: 238 [2021-01-07 04:55:16,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-01-07 04:55:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 160. [2021-01-07 04:55:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2021-01-07 04:55:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2021-01-07 04:55:16,070 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 10 [2021-01-07 04:55:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:16,070 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2021-01-07 04:55:16,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2021-01-07 04:55:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 04:55:16,072 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:16,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:16,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 04:55:16,073 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:16,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1838356767, now seen corresponding path program 1 times [2021-01-07 04:55:16,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:16,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207907087] [2021-01-07 04:55:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:16,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207907087] [2021-01-07 04:55:16,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:16,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:55:16,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117794814] [2021-01-07 04:55:16,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:55:16,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:55:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:55:16,188 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand 5 states. [2021-01-07 04:55:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:16,266 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2021-01-07 04:55:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:55:16,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-07 04:55:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:16,268 INFO L225 Difference]: With dead ends: 165 [2021-01-07 04:55:16,268 INFO L226 Difference]: Without dead ends: 160 [2021-01-07 04:55:16,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:55:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-07 04:55:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2021-01-07 04:55:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-07 04:55:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2021-01-07 04:55:16,277 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 11 [2021-01-07 04:55:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:16,277 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2021-01-07 04:55:16,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:55:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2021-01-07 04:55:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 04:55:16,279 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:16,281 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:16,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 04:55:16,283 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:16,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1943650944, now seen corresponding path program 1 times [2021-01-07 04:55:16,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:16,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306559630] [2021-01-07 04:55:16,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:16,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306559630] [2021-01-07 04:55:16,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915539029] [2021-01-07 04:55:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:16,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:55:16,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:16,647 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:55:16,648 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:16,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:16,652 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:16,652 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 04:55:16,711 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:16,719 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:16,730 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:16,745 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 04:55:16,747 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:16,748 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 04:55:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:16,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:16,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2021-01-07 04:55:16,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590393699] [2021-01-07 04:55:16,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:55:16,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:55:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:55:16,764 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 5 states. [2021-01-07 04:55:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:16,992 INFO L93 Difference]: Finished difference Result 280 states and 307 transitions. [2021-01-07 04:55:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:55:16,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-07 04:55:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:16,996 INFO L225 Difference]: With dead ends: 280 [2021-01-07 04:55:16,997 INFO L226 Difference]: Without dead ends: 280 [2021-01-07 04:55:16,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:55:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-07 04:55:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 154. [2021-01-07 04:55:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-07 04:55:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2021-01-07 04:55:17,004 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 18 [2021-01-07 04:55:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:17,004 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2021-01-07 04:55:17,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:55:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2021-01-07 04:55:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 04:55:17,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:17,006 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:17,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-01-07 04:55:17,220 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1943650945, now seen corresponding path program 1 times [2021-01-07 04:55:17,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:17,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576892825] [2021-01-07 04:55:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:17,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576892825] [2021-01-07 04:55:17,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325491853] [2021-01-07 04:55:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:17,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-07 04:55:17,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:17,415 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:55:17,416 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:17,421 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:17,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:17,422 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 04:55:17,478 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:17,479 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:17,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:17,500 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 04:55:17,502 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:17,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 04:55:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:17,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:17,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 4 [2021-01-07 04:55:17,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448857399] [2021-01-07 04:55:17,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:55:17,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:17,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:55:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:55:17,520 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 5 states. [2021-01-07 04:55:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:17,755 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-01-07 04:55:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:55:17,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-07 04:55:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:17,758 INFO L225 Difference]: With dead ends: 249 [2021-01-07 04:55:17,758 INFO L226 Difference]: Without dead ends: 249 [2021-01-07 04:55:17,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:55:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-01-07 04:55:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 153. [2021-01-07 04:55:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2021-01-07 04:55:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2021-01-07 04:55:17,763 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 18 [2021-01-07 04:55:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:17,764 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2021-01-07 04:55:17,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:55:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2021-01-07 04:55:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-07 04:55:17,765 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:17,765 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:17,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:17,979 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:17,980 INFO L82 PathProgramCache]: Analyzing trace with hash -698576366, now seen corresponding path program 1 times [2021-01-07 04:55:17,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:17,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192688713] [2021-01-07 04:55:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:18,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192688713] [2021-01-07 04:55:18,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:18,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:55:18,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258219014] [2021-01-07 04:55:18,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:18,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:18,011 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand 3 states. [2021-01-07 04:55:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:18,070 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2021-01-07 04:55:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:18,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-01-07 04:55:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:18,072 INFO L225 Difference]: With dead ends: 161 [2021-01-07 04:55:18,073 INFO L226 Difference]: Without dead ends: 161 [2021-01-07 04:55:18,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-01-07 04:55:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2021-01-07 04:55:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-01-07 04:55:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2021-01-07 04:55:18,078 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 19 [2021-01-07 04:55:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:18,078 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2021-01-07 04:55:18,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2021-01-07 04:55:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 04:55:18,081 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:18,081 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:18,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 04:55:18,082 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash -681478608, now seen corresponding path program 1 times [2021-01-07 04:55:18,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:18,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670990582] [2021-01-07 04:55:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:55:18,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670990582] [2021-01-07 04:55:18,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:18,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:55:18,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028520596] [2021-01-07 04:55:18,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:55:18,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:18,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:55:18,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:55:18,165 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 5 states. [2021-01-07 04:55:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:18,385 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2021-01-07 04:55:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:55:18,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2021-01-07 04:55:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:18,388 INFO L225 Difference]: With dead ends: 191 [2021-01-07 04:55:18,388 INFO L226 Difference]: Without dead ends: 191 [2021-01-07 04:55:18,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-07 04:55:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 151. [2021-01-07 04:55:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-07 04:55:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2021-01-07 04:55:18,408 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 20 [2021-01-07 04:55:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:18,409 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2021-01-07 04:55:18,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:55:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2021-01-07 04:55:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 04:55:18,410 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:18,410 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:18,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 04:55:18,410 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash -681478607, now seen corresponding path program 1 times [2021-01-07 04:55:18,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:18,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465421606] [2021-01-07 04:55:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:55:18,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465421606] [2021-01-07 04:55:18,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:18,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:55:18,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366119710] [2021-01-07 04:55:18,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:55:18,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:18,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:55:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:55:18,480 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand 5 states. [2021-01-07 04:55:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:18,690 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2021-01-07 04:55:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:55:18,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2021-01-07 04:55:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:18,692 INFO L225 Difference]: With dead ends: 150 [2021-01-07 04:55:18,692 INFO L226 Difference]: Without dead ends: 150 [2021-01-07 04:55:18,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-01-07 04:55:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-01-07 04:55:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 04:55:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2021-01-07 04:55:18,697 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 20 [2021-01-07 04:55:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:18,697 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2021-01-07 04:55:18,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:55:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2021-01-07 04:55:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 04:55:18,698 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:18,698 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:18,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 04:55:18,699 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash 381240992, now seen corresponding path program 1 times [2021-01-07 04:55:18,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:18,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272494292] [2021-01-07 04:55:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:18,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272494292] [2021-01-07 04:55:18,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:18,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:55:18,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626674662] [2021-01-07 04:55:18,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:55:18,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:55:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:18,821 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 8 states. [2021-01-07 04:55:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:19,254 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2021-01-07 04:55:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:55:19,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2021-01-07 04:55:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:19,256 INFO L225 Difference]: With dead ends: 156 [2021-01-07 04:55:19,256 INFO L226 Difference]: Without dead ends: 156 [2021-01-07 04:55:19,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-01-07 04:55:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-01-07 04:55:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2021-01-07 04:55:19,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 04:55:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2021-01-07 04:55:19,261 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 23 [2021-01-07 04:55:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:19,261 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2021-01-07 04:55:19,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:55:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2021-01-07 04:55:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 04:55:19,262 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:19,262 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:19,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 04:55:19,263 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash 381240991, now seen corresponding path program 1 times [2021-01-07 04:55:19,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:19,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430413689] [2021-01-07 04:55:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:19,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430413689] [2021-01-07 04:55:19,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:19,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:55:19,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730369716] [2021-01-07 04:55:19,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:55:19,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:19,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:55:19,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:19,349 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 8 states. [2021-01-07 04:55:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:19,781 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2021-01-07 04:55:19,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:55:19,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2021-01-07 04:55:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:19,782 INFO L225 Difference]: With dead ends: 155 [2021-01-07 04:55:19,783 INFO L226 Difference]: Without dead ends: 155 [2021-01-07 04:55:19,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-07 04:55:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-07 04:55:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2021-01-07 04:55:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 04:55:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2021-01-07 04:55:19,787 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 23 [2021-01-07 04:55:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:19,788 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2021-01-07 04:55:19,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:55:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2021-01-07 04:55:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 04:55:19,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:19,789 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:19,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 04:55:19,789 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1656882935, now seen corresponding path program 1 times [2021-01-07 04:55:19,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:19,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351260518] [2021-01-07 04:55:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:19,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351260518] [2021-01-07 04:55:19,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:19,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 04:55:19,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009353416] [2021-01-07 04:55:19,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:55:19,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:55:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:55:19,900 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 9 states. [2021-01-07 04:55:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:20,441 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2021-01-07 04:55:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:55:20,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2021-01-07 04:55:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:20,443 INFO L225 Difference]: With dead ends: 154 [2021-01-07 04:55:20,444 INFO L226 Difference]: Without dead ends: 154 [2021-01-07 04:55:20,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-01-07 04:55:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-07 04:55:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2021-01-07 04:55:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 04:55:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2021-01-07 04:55:20,448 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 26 [2021-01-07 04:55:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:20,449 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2021-01-07 04:55:20,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:55:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2021-01-07 04:55:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 04:55:20,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:20,450 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:20,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 04:55:20,450 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1656882936, now seen corresponding path program 1 times [2021-01-07 04:55:20,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:20,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686322849] [2021-01-07 04:55:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:20,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686322849] [2021-01-07 04:55:20,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:20,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 04:55:20,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695748292] [2021-01-07 04:55:20,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:55:20,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:20,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:55:20,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:55:20,593 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 9 states. [2021-01-07 04:55:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:21,090 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2021-01-07 04:55:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:55:21,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2021-01-07 04:55:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:21,092 INFO L225 Difference]: With dead ends: 153 [2021-01-07 04:55:21,092 INFO L226 Difference]: Without dead ends: 153 [2021-01-07 04:55:21,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-01-07 04:55:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-01-07 04:55:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2021-01-07 04:55:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 04:55:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2021-01-07 04:55:21,097 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 26 [2021-01-07 04:55:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:21,097 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2021-01-07 04:55:21,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:55:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2021-01-07 04:55:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 04:55:21,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:21,098 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:21,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 04:55:21,098 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1859558714, now seen corresponding path program 1 times [2021-01-07 04:55:21,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:21,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386272875] [2021-01-07 04:55:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:21,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386272875] [2021-01-07 04:55:21,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:21,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 04:55:21,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765716473] [2021-01-07 04:55:21,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 04:55:21,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 04:55:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-07 04:55:21,225 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand 10 states. [2021-01-07 04:55:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:21,736 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2021-01-07 04:55:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 04:55:21,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2021-01-07 04:55:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:21,738 INFO L225 Difference]: With dead ends: 152 [2021-01-07 04:55:21,738 INFO L226 Difference]: Without dead ends: 152 [2021-01-07 04:55:21,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-01-07 04:55:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-01-07 04:55:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2021-01-07 04:55:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 04:55:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2021-01-07 04:55:21,743 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 29 [2021-01-07 04:55:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:21,743 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2021-01-07 04:55:21,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 04:55:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2021-01-07 04:55:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 04:55:21,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:21,744 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:21,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 04:55:21,745 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1859558713, now seen corresponding path program 1 times [2021-01-07 04:55:21,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:21,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068732650] [2021-01-07 04:55:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:21,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068732650] [2021-01-07 04:55:21,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:21,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:55:21,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599531415] [2021-01-07 04:55:21,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:55:21,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:21,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:55:21,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:21,997 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 8 states. [2021-01-07 04:55:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:22,510 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2021-01-07 04:55:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:55:22,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2021-01-07 04:55:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:22,512 INFO L225 Difference]: With dead ends: 151 [2021-01-07 04:55:22,513 INFO L226 Difference]: Without dead ends: 151 [2021-01-07 04:55:22,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-01-07 04:55:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-01-07 04:55:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2021-01-07 04:55:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 04:55:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2021-01-07 04:55:22,518 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 29 [2021-01-07 04:55:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:22,518 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2021-01-07 04:55:22,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:55:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2021-01-07 04:55:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 04:55:22,519 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:22,519 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:22,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 04:55:22,520 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:22,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:22,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1358325695, now seen corresponding path program 1 times [2021-01-07 04:55:22,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:22,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341900400] [2021-01-07 04:55:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:22,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341900400] [2021-01-07 04:55:22,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820060307] [2021-01-07 04:55:22,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:22,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-07 04:55:22,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:23,006 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 04:55:23,006 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,031 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 04:55:23,032 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,043 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,045 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,045 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2021-01-07 04:55:23,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,101 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 04:55:23,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,123 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 04:55:23,125 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,137 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,138 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:34 [2021-01-07 04:55:23,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,160 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 04:55:23,161 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,184 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 04:55:23,186 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,205 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,206 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2021-01-07 04:55:23,272 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 04:55:23,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:23,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:23,284 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,303 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,303 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2021-01-07 04:55:23,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,404 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-01-07 04:55:23,411 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,443 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-01-07 04:55:23,446 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,469 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:62 [2021-01-07 04:55:23,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,607 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2021-01-07 04:55:23,610 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,633 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:23,662 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:23,662 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 77 [2021-01-07 04:55:23,671 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-07 04:55:23,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 04:55:23,673 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,741 INFO L625 ElimStorePlain]: treesize reduction 8, result has 91.3 percent of original size [2021-01-07 04:55:23,746 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:23,746 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:84 [2021-01-07 04:55:23,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:23,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:24,016 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:24,017 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 91 treesize of output 218 [2021-01-07 04:55:24,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 3, 2, 1] term [2021-01-07 04:55:24,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 04:55:24,033 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:24,169 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2021-01-07 04:55:24,171 INFO L625 ElimStorePlain]: treesize reduction 258, result has 31.4 percent of original size [2021-01-07 04:55:24,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:24,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:24,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:24,298 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-07 04:55:24,298 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:24,299 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 272 [2021-01-07 04:55:24,312 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:24,420 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2021-01-07 04:55:24,420 INFO L625 ElimStorePlain]: treesize reduction 132, result has 43.6 percent of original size [2021-01-07 04:55:24,423 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:24,424 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:102 [2021-01-07 04:55:25,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:25,281 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,282 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 254 [2021-01-07 04:55:25,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 1] term [2021-01-07 04:55:25,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 04:55:25,296 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:25,425 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2021-01-07 04:55:25,426 INFO L625 ElimStorePlain]: treesize reduction 293, result has 31.2 percent of original size [2021-01-07 04:55:25,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,454 INFO L348 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2021-01-07 04:55:25,455 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 75 [2021-01-07 04:55:25,458 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:25,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-07 04:55:25,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:25,513 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:25,513 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:146, output treesize:62 [2021-01-07 04:55:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,668 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,668 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 157 [2021-01-07 04:55:25,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 04:55:25,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:25,677 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:25,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,714 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2021-01-07 04:55:25,716 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:25,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,752 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:25,753 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2021-01-07 04:55:25,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,922 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,922 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 75 [2021-01-07 04:55:25,926 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:55:25,927 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:55:25,930 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:25,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:25,960 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2021-01-07 04:55:25,962 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:25,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:25,976 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:25,977 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:106, output treesize:7 [2021-01-07 04:55:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:25,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:25,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 26 [2021-01-07 04:55:25,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610433705] [2021-01-07 04:55:25,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 04:55:25,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:25,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 04:55:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2021-01-07 04:55:25,998 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 26 states. [2021-01-07 04:55:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:28,223 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2021-01-07 04:55:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 04:55:28,224 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2021-01-07 04:55:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:28,225 INFO L225 Difference]: With dead ends: 178 [2021-01-07 04:55:28,225 INFO L226 Difference]: Without dead ends: 178 [2021-01-07 04:55:28,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 04:55:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-01-07 04:55:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2021-01-07 04:55:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2021-01-07 04:55:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions. [2021-01-07 04:55:28,234 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 34 [2021-01-07 04:55:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:28,235 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 185 transitions. [2021-01-07 04:55:28,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 04:55:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2021-01-07 04:55:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 04:55:28,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:28,236 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:28,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:28,456 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1301544654, now seen corresponding path program 1 times [2021-01-07 04:55:28,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:28,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172715505] [2021-01-07 04:55:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:55:28,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172715505] [2021-01-07 04:55:28,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:28,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:55:28,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598743802] [2021-01-07 04:55:28,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:55:28,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:55:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:55:28,549 INFO L87 Difference]: Start difference. First operand 175 states and 185 transitions. Second operand 6 states. [2021-01-07 04:55:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:28,693 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2021-01-07 04:55:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:55:28,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2021-01-07 04:55:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:28,695 INFO L225 Difference]: With dead ends: 176 [2021-01-07 04:55:28,695 INFO L226 Difference]: Without dead ends: 176 [2021-01-07 04:55:28,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:55:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-01-07 04:55:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2021-01-07 04:55:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2021-01-07 04:55:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 183 transitions. [2021-01-07 04:55:28,699 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 183 transitions. Word has length 37 [2021-01-07 04:55:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:28,700 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 183 transitions. [2021-01-07 04:55:28,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:55:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 183 transitions. [2021-01-07 04:55:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 04:55:28,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:28,702 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:28,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 04:55:28,702 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1693181933, now seen corresponding path program 1 times [2021-01-07 04:55:28,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:28,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562133011] [2021-01-07 04:55:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:55:28,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562133011] [2021-01-07 04:55:28,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:28,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:55:28,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473464385] [2021-01-07 04:55:28,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:55:28,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:28,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:55:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:55:28,797 INFO L87 Difference]: Start difference. First operand 175 states and 183 transitions. Second operand 7 states. [2021-01-07 04:55:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:29,003 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2021-01-07 04:55:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:55:29,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2021-01-07 04:55:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:29,005 INFO L225 Difference]: With dead ends: 200 [2021-01-07 04:55:29,005 INFO L226 Difference]: Without dead ends: 200 [2021-01-07 04:55:29,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:55:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-01-07 04:55:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 174. [2021-01-07 04:55:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2021-01-07 04:55:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2021-01-07 04:55:29,016 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 38 [2021-01-07 04:55:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:29,017 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2021-01-07 04:55:29,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:55:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2021-01-07 04:55:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 04:55:29,018 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:29,018 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:29,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 04:55:29,018 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash 644958423, now seen corresponding path program 1 times [2021-01-07 04:55:29,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:29,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427749196] [2021-01-07 04:55:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:29,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427749196] [2021-01-07 04:55:29,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487451455] [2021-01-07 04:55:29,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:29,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 04:55:29,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:29,251 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:55:29,252 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:29,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:29,254 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:29,255 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 04:55:29,289 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:29,290 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:29,296 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:29,313 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 04:55:29,316 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:29,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 04:55:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:29,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:29,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-01-07 04:55:29,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948076115] [2021-01-07 04:55:29,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:55:29,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:55:29,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:55:29,352 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand 9 states. [2021-01-07 04:55:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:29,746 INFO L93 Difference]: Finished difference Result 212 states and 223 transitions. [2021-01-07 04:55:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:55:29,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2021-01-07 04:55:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:29,752 INFO L225 Difference]: With dead ends: 212 [2021-01-07 04:55:29,752 INFO L226 Difference]: Without dead ends: 212 [2021-01-07 04:55:29,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-01-07 04:55:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-01-07 04:55:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 172. [2021-01-07 04:55:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2021-01-07 04:55:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 181 transitions. [2021-01-07 04:55:29,757 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 181 transitions. Word has length 40 [2021-01-07 04:55:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:29,758 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 181 transitions. [2021-01-07 04:55:29,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:55:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 181 transitions. [2021-01-07 04:55:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 04:55:29,759 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:29,759 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:29,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:29,973 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 644958424, now seen corresponding path program 1 times [2021-01-07 04:55:29,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:29,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316934685] [2021-01-07 04:55:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:30,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316934685] [2021-01-07 04:55:30,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362447623] [2021-01-07 04:55:30,136 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 [2021-01-07 04:55:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:30,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 04:55:30,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:30,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:30,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-01-07 04:55:30,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266195621] [2021-01-07 04:55:30,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 04:55:30,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 04:55:30,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-01-07 04:55:30,375 INFO L87 Difference]: Start difference. First operand 172 states and 181 transitions. Second operand 14 states. [2021-01-07 04:55:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:30,882 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2021-01-07 04:55:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 04:55:30,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2021-01-07 04:55:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:30,884 INFO L225 Difference]: With dead ends: 191 [2021-01-07 04:55:30,884 INFO L226 Difference]: Without dead ends: 191 [2021-01-07 04:55:30,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-01-07 04:55:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-07 04:55:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2021-01-07 04:55:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2021-01-07 04:55:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 183 transitions. [2021-01-07 04:55:30,889 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 183 transitions. Word has length 40 [2021-01-07 04:55:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:30,890 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 183 transitions. [2021-01-07 04:55:30,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 04:55:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 183 transitions. [2021-01-07 04:55:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 04:55:30,890 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:30,891 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:31,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 04:55:31,105 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1329758428, now seen corresponding path program 1 times [2021-01-07 04:55:31,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:31,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016892907] [2021-01-07 04:55:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:31,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016892907] [2021-01-07 04:55:31,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618970075] [2021-01-07 04:55:31,256 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 [2021-01-07 04:55:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:31,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 04:55:31,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:31,391 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:55:31,391 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:31,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:31,397 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:31,397 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 04:55:31,463 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:31,464 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:31,466 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:31,483 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 04:55:31,484 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:31,484 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 04:55:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:55:31,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:55:31,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2021-01-07 04:55:31,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646291907] [2021-01-07 04:55:31,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:55:31,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:31,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:55:31,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-01-07 04:55:31,617 INFO L87 Difference]: Start difference. First operand 174 states and 183 transitions. Second operand 9 states. [2021-01-07 04:55:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:32,130 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2021-01-07 04:55:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:55:32,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2021-01-07 04:55:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:32,131 INFO L225 Difference]: With dead ends: 189 [2021-01-07 04:55:32,131 INFO L226 Difference]: Without dead ends: 189 [2021-01-07 04:55:32,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-01-07 04:55:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-07 04:55:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2021-01-07 04:55:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2021-01-07 04:55:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2021-01-07 04:55:32,136 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 42 [2021-01-07 04:55:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:32,136 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2021-01-07 04:55:32,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:55:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2021-01-07 04:55:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 04:55:32,137 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:32,137 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:32,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:32,351 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1727189378, now seen corresponding path program 1 times [2021-01-07 04:55:32,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:32,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411615517] [2021-01-07 04:55:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:32,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411615517] [2021-01-07 04:55:32,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530222126] [2021-01-07 04:55:32,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:32,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core [2021-01-07 04:55:32,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:32,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:32,958 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:32,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:32,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:32,986 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:33,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:33,002 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:33,002 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2021-01-07 04:55:33,054 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 04:55:33,056 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:33,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:33,071 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:33,071 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2021-01-07 04:55:33,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:33,143 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:33,144 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2021-01-07 04:55:33,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-07 04:55:33,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:33,148 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:33,188 INFO L625 ElimStorePlain]: treesize reduction 25, result has 59.0 percent of original size [2021-01-07 04:55:33,189 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:33,189 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:36 [2021-01-07 04:55:33,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:33,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:33,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:33,362 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:33,362 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 51 [2021-01-07 04:55:33,365 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:33,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:33,411 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:33,412 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 86 [2021-01-07 04:55:33,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 04:55:33,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 04:55:33,420 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:33,550 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2021-01-07 04:55:33,551 INFO L625 ElimStorePlain]: treesize reduction 144, result has 34.2 percent of original size [2021-01-07 04:55:33,553 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-01-07 04:55:33,554 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:75 [2021-01-07 04:55:34,060 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-01-07 04:55:34,615 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-01-07 04:55:34,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:34,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2021-01-07 04:55:34,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:34,637 INFO L443 ElimStorePlain]: Different costs {6=[v_prenex_3], 12=[|v_#memory_$Pointer$.base_47|]} [2021-01-07 04:55:34,681 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:34,681 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 120 [2021-01-07 04:55:34,686 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:34,832 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-01-07 04:55:34,833 INFO L625 ElimStorePlain]: treesize reduction 56, result has 69.2 percent of original size [2021-01-07 04:55:34,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:34,912 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:34,913 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 177 [2021-01-07 04:55:34,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 04:55:34,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:34,920 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:35,077 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2021-01-07 04:55:35,078 INFO L625 ElimStorePlain]: treesize reduction 219, result has 34.4 percent of original size [2021-01-07 04:55:35,083 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 04:55:35,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:155, output treesize:64 [2021-01-07 04:55:35,282 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:35,282 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2021-01-07 04:55:35,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 04:55:35,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 04:55:35,287 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:35,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:35,306 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:35,307 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:44 [2021-01-07 04:55:35,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:35,795 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:35,795 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 33 [2021-01-07 04:55:35,797 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:35,819 INFO L625 ElimStorePlain]: treesize reduction 3, result has 88.5 percent of original size [2021-01-07 04:55:35,822 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:35,822 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:5 [2021-01-07 04:55:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:35,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:35,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2021-01-07 04:55:35,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935410752] [2021-01-07 04:55:35,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 04:55:35,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 04:55:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 04:55:35,844 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand 33 states. [2021-01-07 04:55:37,879 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2021-01-07 04:55:39,251 WARN L197 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2021-01-07 04:55:40,642 WARN L197 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2021-01-07 04:55:42,113 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2021-01-07 04:55:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:44,493 INFO L93 Difference]: Finished difference Result 279 states and 300 transitions. [2021-01-07 04:55:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 04:55:44,494 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2021-01-07 04:55:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:44,495 INFO L225 Difference]: With dead ends: 279 [2021-01-07 04:55:44,495 INFO L226 Difference]: Without dead ends: 279 [2021-01-07 04:55:44,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=425, Invalid=2331, Unknown=0, NotChecked=0, Total=2756 [2021-01-07 04:55:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-01-07 04:55:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 193. [2021-01-07 04:55:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2021-01-07 04:55:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2021-01-07 04:55:44,502 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 43 [2021-01-07 04:55:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:44,502 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2021-01-07 04:55:44,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 04:55:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2021-01-07 04:55:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 04:55:44,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:44,503 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:44,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 04:55:44,717 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 04:55:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1727189377, now seen corresponding path program 1 times [2021-01-07 04:55:44,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:44,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040041253] [2021-01-07 04:55:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:45,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040041253] [2021-01-07 04:55:45,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250217828] [2021-01-07 04:55:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:45,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 53 conjunts are in the unsatisfiable core [2021-01-07 04:55:45,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:45,308 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:45,309 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:45,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:45,331 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:45,333 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:45,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:45,354 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:45,354 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2021-01-07 04:55:45,422 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-01-07 04:55:45,423 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:45,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:45,439 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:45,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2021-01-07 04:55:45,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:45,511 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:45,512 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2021-01-07 04:55:45,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-07 04:55:45,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:45,515 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:45,555 INFO L625 ElimStorePlain]: treesize reduction 25, result has 59.0 percent of original size [2021-01-07 04:55:45,556 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:45,556 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:36 [2021-01-07 04:55:45,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:45,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:45,744 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:45,744 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 86 [2021-01-07 04:55:45,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 04:55:45,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 04:55:45,749 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:45,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:45,778 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:45,778 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 51 [2021-01-07 04:55:45,780 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:45,896 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2021-01-07 04:55:45,896 INFO L625 ElimStorePlain]: treesize reduction 144, result has 34.2 percent of original size [2021-01-07 04:55:45,898 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-01-07 04:55:45,899 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:75 [2021-01-07 04:55:46,419 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-01-07 04:55:46,984 WARN L197 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-01-07 04:55:46,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:46,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:46,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:47,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:47,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 9, 1] term [2021-01-07 04:55:47,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 04:55:47,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:47,021 INFO L443 ElimStorePlain]: Different costs {2=[v_prenex_6, |v_#memory_$Pointer$.offset_46|], 6=[v_prenex_5], 12=[|v_#memory_$Pointer$.base_52|]} [2021-01-07 04:55:47,029 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2021-01-07 04:55:47,031 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:47,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:47,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:47,131 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2021-01-07 04:55:47,132 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:47,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:47,260 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:47,261 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 158 [2021-01-07 04:55:47,264 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:47,421 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-01-07 04:55:47,422 INFO L625 ElimStorePlain]: treesize reduction 76, result has 68.9 percent of original size [2021-01-07 04:55:47,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:47,518 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:47,519 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 227 [2021-01-07 04:55:47,522 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 04:55:47,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:47,528 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:47,734 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2021-01-07 04:55:47,735 INFO L625 ElimStorePlain]: treesize reduction 281, result has 35.8 percent of original size [2021-01-07 04:55:47,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 04:55:47,738 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:279, output treesize:115 [2021-01-07 04:55:48,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:55:48,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 04:55:48,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 9, 2, 1] term [2021-01-07 04:55:48,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:48,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 04:55:48,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 04:55:48,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:48,048 INFO L443 ElimStorePlain]: Different costs {2=[v_prenex_7, v_prenex_10, |v_#memory_$Pointer$.offset_47|], 6=[|v_#memory_$Pointer$.base_53|]} [2021-01-07 04:55:48,073 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:48,074 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 64 [2021-01-07 04:55:48,076 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:48,364 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2021-01-07 04:55:48,365 INFO L625 ElimStorePlain]: treesize reduction 45, result has 84.4 percent of original size [2021-01-07 04:55:48,377 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 34 treesize of output 29 [2021-01-07 04:55:48,379 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:48,480 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 04:55:48,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:48,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:55:48,495 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2021-01-07 04:55:48,497 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:48,507 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2021-01-07 04:55:48,509 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:48,613 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-07 04:55:48,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:48,648 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:48,649 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2021-01-07 04:55:48,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 04:55:48,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 04:55:48,654 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:48,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:55:48,703 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:48,704 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 106 [2021-01-07 04:55:48,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 04:55:48,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 04:55:48,709 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2021-01-07 04:55:48,915 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-01-07 04:55:48,916 INFO L625 ElimStorePlain]: treesize reduction 100, result has 68.3 percent of original size [2021-01-07 04:55:48,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:48,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:48,931 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2021-01-07 04:55:48,931 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:280, output treesize:242 [2021-01-07 04:55:48,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:48,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:49,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:49,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:49,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:49,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:49,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:49,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:49,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:49,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:49,749 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 04:55:49,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:49,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:49,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:55:49,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:55:56,837 WARN L197 SmtUtils]: Spent 6.94 s on a formula simplification that was a NOOP. DAG size: 91 [2021-01-07 04:55:56,853 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 04:56:00,567 WARN L197 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 107 [2021-01-07 04:56:00,581 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 04:56:02,140 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 107 [2021-01-07 04:56:02,465 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-01-07 04:56:02,496 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 04:56:02,509 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 04:56:02,521 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 04:56:02,557 INFO L443 ElimStorePlain]: Different costs {90=[|#memory_$Pointer$.offset|], 109=[|#memory_$Pointer$.base|]} [2021-01-07 04:56:02,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,570 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 23 [2021-01-07 04:56:02,572 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,585 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2021-01-07 04:56:02,587 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,605 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,605 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 49 [2021-01-07 04:56:02,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:56:02,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 04:56:02,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 04:56:02,613 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:02,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,635 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2021-01-07 04:56:02,636 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,855 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-01-07 04:56:02,856 INFO L625 ElimStorePlain]: treesize reduction 32, result has 87.8 percent of original size [2021-01-07 04:56:02,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,876 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,877 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-01-07 04:56:02,878 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,905 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,905 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2021-01-07 04:56:02,907 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 04:56:02,908 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,925 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,925 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 33 [2021-01-07 04:56:02,926 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,953 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,954 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 52 [2021-01-07 04:56:02,956 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:03,118 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-01-07 04:56:03,119 INFO L625 ElimStorePlain]: treesize reduction 8, result has 93.7 percent of original size [2021-01-07 04:56:03,126 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-01-07 04:56:03,126 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:399, output treesize:41 [2021-01-07 04:56:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:56:03,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:56:03,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2021-01-07 04:56:03,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647881029] [2021-01-07 04:56:03,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-07 04:56:03,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:03,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-07 04:56:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 04:56:03,278 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand 34 states. [2021-01-07 04:56:12,442 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2021-01-07 04:56:13,715 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2021-01-07 04:56:14,984 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-01-07 04:56:16,328 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-01-07 04:56:16,549 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2021-01-07 04:56:16,741 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2021-01-07 04:56:17,057 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2021-01-07 04:56:17,312 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 [2021-01-07 04:56:21,526 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2021-01-07 04:56:29,670 WARN L197 SmtUtils]: Spent 8.03 s on a formula simplification that was a NOOP. DAG size: 93 [2021-01-07 04:56:47,344 WARN L197 SmtUtils]: Spent 17.58 s on a formula simplification that was a NOOP. DAG size: 162 [2021-01-07 04:57:29,896 WARN L197 SmtUtils]: Spent 42.44 s on a formula simplification that was a NOOP. DAG size: 247 [2021-01-07 04:58:27,431 WARN L197 SmtUtils]: Spent 57.41 s on a formula simplification that was a NOOP. DAG size: 329