/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-simple/sll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:41:34,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:41:34,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:41:34,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:41:34,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:41:34,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:41:34,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:41:34,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:41:34,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:41:34,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:41:34,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:41:34,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:41:34,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:41:34,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:41:34,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:41:34,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:41:34,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:41:34,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:41:34,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:41:34,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:41:34,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:41:34,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:41:34,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:41:34,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:41:34,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:41:34,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:41:34,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:41:34,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:41:34,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:41:34,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:41:34,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:41:34,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:41:34,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:41:34,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:41:34,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:41:34,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:41:34,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:41:34,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:41:34,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:41:34,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:41:34,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:41:34,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:41:34,706 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:41:34,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:41:34,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:41:34,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:41:34,711 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:41:34,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:41:34,712 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:41:34,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:41:34,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:41:34,713 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:41:34,714 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:41:34,714 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:41:34,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:41:34,714 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:41:34,715 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:41:34,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:41:34,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:41:34,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:41:34,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:41:34,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:41:34,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:41:34,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:41:34,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:41:34,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:41:34,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 05:41:35,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:41:35,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:41:35,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:41:35,130 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:41:35,131 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:41:35,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all.i [2021-01-07 05:41:35,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fe2f2c655/165087340edb4c99bb5bd771a5b2142e/FLAGe514dd9e6 [2021-01-07 05:41:35,984 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:41:35,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i [2021-01-07 05:41:36,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fe2f2c655/165087340edb4c99bb5bd771a5b2142e/FLAGe514dd9e6 [2021-01-07 05:41:36,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fe2f2c655/165087340edb4c99bb5bd771a5b2142e [2021-01-07 05:41:36,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:41:36,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:41:36,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:41:36,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:41:36,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:41:36,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:36,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c043cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36, skipping insertion in model container [2021-01-07 05:41:36,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:36,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:41:36,369 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-07 05:41:36,760 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2021-01-07 05:41:36,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:41:36,783 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-07 05:41:36,864 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2021-01-07 05:41:36,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:41:36,952 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:41:36,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36 WrapperNode [2021-01-07 05:41:36,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:41:36,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:41:36,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:41:36,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:41:36,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:41:37,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:41:37,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:41:37,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:41:37,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... [2021-01-07 05:41:37,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:41:37,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:41:37,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:41:37,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:41:37,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:41:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:41:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:41:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:41:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:41:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:41:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:41:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 05:41:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:41:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:41:37,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:41:37,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:41:37,763 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-01-07 05:41:37,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:41:37 BoogieIcfgContainer [2021-01-07 05:41:37,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:41:37,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:41:37,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:41:37,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:41:37,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:41:36" (1/3) ... [2021-01-07 05:41:37,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e10354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:41:37, skipping insertion in model container [2021-01-07 05:41:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:41:36" (2/3) ... [2021-01-07 05:41:37,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e10354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:41:37, skipping insertion in model container [2021-01-07 05:41:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:41:37" (3/3) ... [2021-01-07 05:41:37,777 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2021-01-07 05:41:37,785 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:41:37,791 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2021-01-07 05:41:37,812 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-01-07 05:41:37,852 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:41:37,853 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:41:37,853 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:41:37,853 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:41:37,853 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:41:37,853 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:41:37,853 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:41:37,854 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:41:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2021-01-07 05:41:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:41:37,894 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:37,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:41:37,895 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-01-07 05:41:37,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:37,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352239589] [2021-01-07 05:41:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:38,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352239589] [2021-01-07 05:41:38,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:38,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:41:38,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511055561] [2021-01-07 05:41:38,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:41:38,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:41:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:41:38,246 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2021-01-07 05:41:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:38,447 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2021-01-07 05:41:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:41:38,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:41:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:38,469 INFO L225 Difference]: With dead ends: 75 [2021-01-07 05:41:38,469 INFO L226 Difference]: Without dead ends: 72 [2021-01-07 05:41:38,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:41:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-07 05:41:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 46. [2021-01-07 05:41:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-07 05:41:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-01-07 05:41:38,516 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 5 [2021-01-07 05:41:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:38,516 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-01-07 05:41:38,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:41:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-01-07 05:41:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:41:38,517 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:38,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:41:38,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:41:38,518 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-01-07 05:41:38,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:38,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278974660] [2021-01-07 05:41:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:38,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278974660] [2021-01-07 05:41:38,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:38,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:41:38,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211499962] [2021-01-07 05:41:38,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:41:38,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:38,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:41:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:41:38,585 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2021-01-07 05:41:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:38,657 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2021-01-07 05:41:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:41:38,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:41:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:38,660 INFO L225 Difference]: With dead ends: 76 [2021-01-07 05:41:38,660 INFO L226 Difference]: Without dead ends: 76 [2021-01-07 05:41:38,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:41:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-01-07 05:41:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2021-01-07 05:41:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-07 05:41:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-01-07 05:41:38,669 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 5 [2021-01-07 05:41:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:38,669 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-01-07 05:41:38,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:41:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-01-07 05:41:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:41:38,670 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:38,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:38,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:41:38,671 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:38,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1808567236, now seen corresponding path program 1 times [2021-01-07 05:41:38,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:38,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917521559] [2021-01-07 05:41:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:38,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917521559] [2021-01-07 05:41:38,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:38,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:41:38,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045322800] [2021-01-07 05:41:38,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:41:38,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:41:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:41:38,709 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 3 states. [2021-01-07 05:41:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:38,722 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2021-01-07 05:41:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:41:38,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-07 05:41:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:38,724 INFO L225 Difference]: With dead ends: 55 [2021-01-07 05:41:38,724 INFO L226 Difference]: Without dead ends: 55 [2021-01-07 05:41:38,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:41:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-01-07 05:41:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2021-01-07 05:41:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-01-07 05:41:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-01-07 05:41:38,731 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 7 [2021-01-07 05:41:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:38,731 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-01-07 05:41:38,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:41:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-01-07 05:41:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:41:38,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:38,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:38,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:41:38,733 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-01-07 05:41:38,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:38,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348880813] [2021-01-07 05:41:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:38,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348880813] [2021-01-07 05:41:38,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:38,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:41:38,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056580738] [2021-01-07 05:41:38,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:41:38,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:38,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:41:38,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:38,830 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2021-01-07 05:41:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:39,004 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2021-01-07 05:41:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:41:39,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-01-07 05:41:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:39,009 INFO L225 Difference]: With dead ends: 72 [2021-01-07 05:41:39,009 INFO L226 Difference]: Without dead ends: 72 [2021-01-07 05:41:39,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:41:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-07 05:41:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 44. [2021-01-07 05:41:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-07 05:41:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-01-07 05:41:39,027 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 9 [2021-01-07 05:41:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:39,027 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-01-07 05:41:39,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:41:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-01-07 05:41:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:41:39,028 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:39,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:39,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:41:39,029 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:39,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-01-07 05:41:39,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:39,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535783117] [2021-01-07 05:41:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:39,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535783117] [2021-01-07 05:41:39,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:39,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:41:39,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909857554] [2021-01-07 05:41:39,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:41:39,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:41:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:39,197 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 5 states. [2021-01-07 05:41:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:39,303 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-01-07 05:41:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:41:39,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-01-07 05:41:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:39,305 INFO L225 Difference]: With dead ends: 48 [2021-01-07 05:41:39,305 INFO L226 Difference]: Without dead ends: 48 [2021-01-07 05:41:39,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:41:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-01-07 05:41:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2021-01-07 05:41:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-01-07 05:41:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-01-07 05:41:39,318 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 9 [2021-01-07 05:41:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:39,318 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-01-07 05:41:39,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:41:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-01-07 05:41:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:41:39,319 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:39,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:39,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:41:39,320 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash -718760712, now seen corresponding path program 1 times [2021-01-07 05:41:39,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:39,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434420328] [2021-01-07 05:41:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:39,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434420328] [2021-01-07 05:41:39,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297900829] [2021-01-07 05:41:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:41:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:39,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:41:39,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:39,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:41:39,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 05:41:39,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426252629] [2021-01-07 05:41:39,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:41:39,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:41:39,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:39,599 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 5 states. [2021-01-07 05:41:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:39,615 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-01-07 05:41:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:41:39,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:41:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:39,617 INFO L225 Difference]: With dead ends: 52 [2021-01-07 05:41:39,617 INFO L226 Difference]: Without dead ends: 52 [2021-01-07 05:41:39,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-07 05:41:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-01-07 05:41:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-07 05:41:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-01-07 05:41:39,623 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 16 [2021-01-07 05:41:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:39,623 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-01-07 05:41:39,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:41:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-01-07 05:41:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:41:39,624 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:39,624 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:39,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-07 05:41:39,841 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:39,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1731307076, now seen corresponding path program 2 times [2021-01-07 05:41:39,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:39,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104584063] [2021-01-07 05:41:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:41:39,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104584063] [2021-01-07 05:41:39,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:39,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:41:39,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149456597] [2021-01-07 05:41:39,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:41:39,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:41:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:41:39,916 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 4 states. [2021-01-07 05:41:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:39,933 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2021-01-07 05:41:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:41:39,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-01-07 05:41:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:39,935 INFO L225 Difference]: With dead ends: 73 [2021-01-07 05:41:39,935 INFO L226 Difference]: Without dead ends: 73 [2021-01-07 05:41:39,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-07 05:41:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2021-01-07 05:41:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:41:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-01-07 05:41:39,941 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 25 [2021-01-07 05:41:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:39,942 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-01-07 05:41:39,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:41:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-01-07 05:41:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:41:39,943 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:39,943 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:39,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:41:39,943 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:39,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1731307113, now seen corresponding path program 1 times [2021-01-07 05:41:39,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:39,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528513753] [2021-01-07 05:41:39,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:41:40,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528513753] [2021-01-07 05:41:40,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830172193] [2021-01-07 05:41:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:41:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:40,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-07 05:41:40,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:40,203 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:41:40,204 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:40,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:40,210 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:40,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:41:40,245 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:40,246 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:41:40,251 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:40,266 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:41:40,269 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:40,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:41:40,313 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:40,313 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:41:40,318 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:40,331 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:41:40,333 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:40,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:41:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:41:40,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:41:40,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2021-01-07 05:41:40,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566348395] [2021-01-07 05:41:40,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:41:40,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:41:40,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:40,357 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 4 states. [2021-01-07 05:41:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:40,434 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2021-01-07 05:41:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:41:40,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-01-07 05:41:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:40,435 INFO L225 Difference]: With dead ends: 66 [2021-01-07 05:41:40,435 INFO L226 Difference]: Without dead ends: 66 [2021-01-07 05:41:40,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:41:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-01-07 05:41:40,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2021-01-07 05:41:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:41:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-01-07 05:41:40,441 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 25 [2021-01-07 05:41:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:40,442 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-01-07 05:41:40,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:41:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-01-07 05:41:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:41:40,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:40,443 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:40,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:41:40,659 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1731307114, now seen corresponding path program 1 times [2021-01-07 05:41:40,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:40,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102278144] [2021-01-07 05:41:40,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:40,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102278144] [2021-01-07 05:41:40,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756994038] [2021-01-07 05:41:40,804 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 05:41:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:40,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 05:41:40,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:40,922 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:41:40,923 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:40,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:40,931 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:40,931 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-01-07 05:41:40,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:40,956 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-01-07 05:41:40,959 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:40,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:40,972 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:40,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2021-01-07 05:41:41,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:41,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:41,104 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:41,105 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:41:41,108 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:41,162 INFO L625 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2021-01-07 05:41:41,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:41,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2021-01-07 05:41:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:41,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:41:41,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 05:41:41,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319847586] [2021-01-07 05:41:41,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:41:41,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:41:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:41:41,386 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 9 states. [2021-01-07 05:41:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:41,587 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-01-07 05:41:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:41:41,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2021-01-07 05:41:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:41,589 INFO L225 Difference]: With dead ends: 60 [2021-01-07 05:41:41,589 INFO L226 Difference]: Without dead ends: 60 [2021-01-07 05:41:41,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:41:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-01-07 05:41:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2021-01-07 05:41:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2021-01-07 05:41:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-01-07 05:41:41,594 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 25 [2021-01-07 05:41:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:41,595 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-01-07 05:41:41,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:41:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-01-07 05:41:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:41:41,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:41,596 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:41,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:41:41,811 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:41,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:41,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2130912971, now seen corresponding path program 1 times [2021-01-07 05:41:41,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:41,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238141998] [2021-01-07 05:41:41,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:41:41,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238141998] [2021-01-07 05:41:41,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:41,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:41:41,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567925161] [2021-01-07 05:41:41,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:41:41,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:41:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:41:41,922 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2021-01-07 05:41:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:42,258 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2021-01-07 05:41:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:41:42,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-07 05:41:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:42,259 INFO L225 Difference]: With dead ends: 59 [2021-01-07 05:41:42,259 INFO L226 Difference]: Without dead ends: 59 [2021-01-07 05:41:42,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:41:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-01-07 05:41:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2021-01-07 05:41:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:41:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2021-01-07 05:41:42,263 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 26 [2021-01-07 05:41:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:42,264 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-01-07 05:41:42,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:41:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2021-01-07 05:41:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:41:42,265 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:42,265 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:42,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:41:42,265 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2130912972, now seen corresponding path program 1 times [2021-01-07 05:41:42,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:42,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390188619] [2021-01-07 05:41:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:41:42,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390188619] [2021-01-07 05:41:42,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:42,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:41:42,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717167148] [2021-01-07 05:41:42,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:41:42,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:42,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:41:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:41:42,491 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 10 states. [2021-01-07 05:41:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:42,952 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-01-07 05:41:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:41:42,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-07 05:41:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:42,954 INFO L225 Difference]: With dead ends: 60 [2021-01-07 05:41:42,954 INFO L226 Difference]: Without dead ends: 60 [2021-01-07 05:41:42,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:41:42,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-01-07 05:41:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2021-01-07 05:41:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:41:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-01-07 05:41:42,959 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 26 [2021-01-07 05:41:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:42,959 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-01-07 05:41:42,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:41:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2021-01-07 05:41:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:41:42,960 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:42,960 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:42,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:41:42,961 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1883260242, now seen corresponding path program 1 times [2021-01-07 05:41:42,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:42,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834052643] [2021-01-07 05:41:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:41:43,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834052643] [2021-01-07 05:41:43,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:43,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:41:43,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759672402] [2021-01-07 05:41:43,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:41:43,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:43,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:41:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:41:43,074 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 10 states. [2021-01-07 05:41:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:43,382 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2021-01-07 05:41:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:41:43,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2021-01-07 05:41:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:43,384 INFO L225 Difference]: With dead ends: 59 [2021-01-07 05:41:43,384 INFO L226 Difference]: Without dead ends: 59 [2021-01-07 05:41:43,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:41:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-01-07 05:41:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2021-01-07 05:41:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:41:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-01-07 05:41:43,392 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 29 [2021-01-07 05:41:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:43,392 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-01-07 05:41:43,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:41:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-01-07 05:41:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:41:43,393 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:43,394 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:43,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:41:43,394 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1748474732, now seen corresponding path program 1 times [2021-01-07 05:41:43,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:43,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148357481] [2021-01-07 05:41:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:41:43,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148357481] [2021-01-07 05:41:43,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:43,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:41:43,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840949175] [2021-01-07 05:41:43,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:41:43,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:41:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:41:43,503 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 10 states. [2021-01-07 05:41:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:43,864 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2021-01-07 05:41:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:41:43,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2021-01-07 05:41:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:43,866 INFO L225 Difference]: With dead ends: 58 [2021-01-07 05:41:43,866 INFO L226 Difference]: Without dead ends: 58 [2021-01-07 05:41:43,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:41:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-07 05:41:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2021-01-07 05:41:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-07 05:41:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-01-07 05:41:43,877 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 30 [2021-01-07 05:41:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:43,878 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-01-07 05:41:43,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:41:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-01-07 05:41:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:41:43,882 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:43,882 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:43,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:41:43,882 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1631858064, now seen corresponding path program 1 times [2021-01-07 05:41:43,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:43,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829613431] [2021-01-07 05:41:43,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:41:43,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829613431] [2021-01-07 05:41:43,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:43,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:41:43,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895870666] [2021-01-07 05:41:43,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:41:43,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:41:43,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:43,962 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 5 states. [2021-01-07 05:41:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:44,046 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2021-01-07 05:41:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:41:44,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2021-01-07 05:41:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:44,047 INFO L225 Difference]: With dead ends: 53 [2021-01-07 05:41:44,048 INFO L226 Difference]: Without dead ends: 53 [2021-01-07 05:41:44,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:41:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-01-07 05:41:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-01-07 05:41:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:41:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-01-07 05:41:44,051 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 31 [2021-01-07 05:41:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:44,052 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-01-07 05:41:44,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:41:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-01-07 05:41:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:41:44,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:44,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:44,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:41:44,053 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash 952007663, now seen corresponding path program 1 times [2021-01-07 05:41:44,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:44,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293083253] [2021-01-07 05:41:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:41:44,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293083253] [2021-01-07 05:41:44,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664709445] [2021-01-07 05:41:44,215 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 05:41:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:44,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 05:41:44,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:44,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:44,434 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-01-07 05:41:44,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:44,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:44,450 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:44,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2021-01-07 05:41:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:41:44,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:41:44,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2021-01-07 05:41:44,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489339008] [2021-01-07 05:41:44,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:41:44,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:44,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:41:44,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:41:44,499 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 7 states. [2021-01-07 05:41:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:44,670 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-01-07 05:41:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:41:44,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2021-01-07 05:41:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:44,671 INFO L225 Difference]: With dead ends: 52 [2021-01-07 05:41:44,671 INFO L226 Difference]: Without dead ends: 52 [2021-01-07 05:41:44,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:41:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-07 05:41:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-01-07 05:41:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-07 05:41:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-01-07 05:41:44,675 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 32 [2021-01-07 05:41:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:44,675 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-01-07 05:41:44,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:41:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-01-07 05:41:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:41:44,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:44,676 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:44,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:41:44,881 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1591269939, now seen corresponding path program 1 times [2021-01-07 05:41:44,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:44,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277550517] [2021-01-07 05:41:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:41:44,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277550517] [2021-01-07 05:41:44,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:41:44,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:41:44,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945548561] [2021-01-07 05:41:44,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:41:44,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:41:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:41:44,932 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 4 states. [2021-01-07 05:41:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:44,975 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2021-01-07 05:41:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:41:44,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-07 05:41:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:44,977 INFO L225 Difference]: With dead ends: 50 [2021-01-07 05:41:44,977 INFO L226 Difference]: Without dead ends: 50 [2021-01-07 05:41:44,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:41:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-07 05:41:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-01-07 05:41:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:41:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-01-07 05:41:44,980 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 35 [2021-01-07 05:41:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:44,980 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-01-07 05:41:44,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:41:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2021-01-07 05:41:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:41:44,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:44,981 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:44,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:41:44,982 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2084729020, now seen corresponding path program 1 times [2021-01-07 05:41:44,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:44,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682496368] [2021-01-07 05:41:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:45,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682496368] [2021-01-07 05:41:45,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731647850] [2021-01-07 05:41:45,904 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 05:41:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:46,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjunts are in the unsatisfiable core [2021-01-07 05:41:46,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:46,072 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:41:46,074 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:46,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:46,079 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:46,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:41:46,286 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:46,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:41:46,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:41:46,307 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:46,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:46,317 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:46,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-01-07 05:41:46,579 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 05:41:46,580 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:46,593 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:46,597 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:46,597 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:36 [2021-01-07 05:41:47,436 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-01-07 05:41:47,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:47,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:47,468 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:47,469 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:81 [2021-01-07 05:41:47,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:47,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:47,759 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 35 treesize of output 31 [2021-01-07 05:41:47,761 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:47,804 INFO L625 ElimStorePlain]: treesize reduction 18, result has 75.0 percent of original size [2021-01-07 05:41:47,806 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:47,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:54 [2021-01-07 05:41:47,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:47,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:47,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:47,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:47,939 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:47,940 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 58 [2021-01-07 05:41:47,944 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 05:41:47,979 INFO L625 ElimStorePlain]: treesize reduction 24, result has 64.2 percent of original size [2021-01-07 05:41:47,984 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:47,985 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-01-07 05:41:48,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:48,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:48,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:48,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:48,251 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:48,252 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 15 [2021-01-07 05:41:48,253 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:48,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:48,276 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:48,277 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:53, output treesize:11 [2021-01-07 05:41:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:48,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:41:48,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2021-01-07 05:41:48,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908684390] [2021-01-07 05:41:48,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-01-07 05:41:48,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:48,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-01-07 05:41:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1964, Unknown=0, NotChecked=0, Total=2162 [2021-01-07 05:41:48,374 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 47 states. [2021-01-07 05:41:49,788 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-07 05:41:50,090 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2021-01-07 05:41:50,356 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2021-01-07 05:41:50,694 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-01-07 05:41:51,055 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-01-07 05:41:51,490 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-01-07 05:41:51,771 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-01-07 05:41:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:52,578 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2021-01-07 05:41:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-01-07 05:41:52,578 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 36 [2021-01-07 05:41:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:52,579 INFO L225 Difference]: With dead ends: 75 [2021-01-07 05:41:52,579 INFO L226 Difference]: Without dead ends: 75 [2021-01-07 05:41:52,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=843, Invalid=5009, Unknown=0, NotChecked=0, Total=5852 [2021-01-07 05:41:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-07 05:41:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2021-01-07 05:41:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-07 05:41:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-01-07 05:41:52,585 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 36 [2021-01-07 05:41:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:52,585 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-01-07 05:41:52,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2021-01-07 05:41:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-01-07 05:41:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:41:52,586 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:52,586 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:52,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 05:41:52,801 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2084729021, now seen corresponding path program 1 times [2021-01-07 05:41:52,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:52,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840132646] [2021-01-07 05:41:52,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:53,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840132646] [2021-01-07 05:41:53,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485917587] [2021-01-07 05:41:53,728 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 05:41:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:53,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 75 conjunts are in the unsatisfiable core [2021-01-07 05:41:53,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:53,891 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:41:53,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:53,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:53,897 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:53,897 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:41:54,219 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:54,220 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 19 treesize of output 33 [2021-01-07 05:41:54,222 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:54,250 INFO L625 ElimStorePlain]: treesize reduction 14, result has 64.1 percent of original size [2021-01-07 05:41:54,251 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:54,251 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:25 [2021-01-07 05:41:54,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:41:54,544 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:54,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:54,573 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:41:54,574 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:54,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:54,596 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:54,596 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:46 [2021-01-07 05:41:55,854 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_15|], 20=[|v_#memory_$Pointer$.base_17|]} [2021-01-07 05:41:55,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:55,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:55,897 INFO L348 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2021-01-07 05:41:55,897 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 4 case distinctions, treesize of input 86 treesize of output 95 [2021-01-07 05:41:55,901 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:55,963 INFO L625 ElimStorePlain]: treesize reduction 50, result has 67.1 percent of original size [2021-01-07 05:41:55,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:55,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:55,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:55,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:55,977 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:55,977 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 89 [2021-01-07 05:41:55,982 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:56,042 INFO L625 ElimStorePlain]: treesize reduction 24, result has 75.0 percent of original size [2021-01-07 05:41:56,048 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:56,048 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:72 [2021-01-07 05:41:56,336 INFO L443 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.base|], 12=[|#memory_$Pointer$.offset|]} [2021-01-07 05:41:56,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:56,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:56,345 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:56,346 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 12 [2021-01-07 05:41:56,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:56,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:56,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:56,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:56,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:56,384 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:56,384 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 18 [2021-01-07 05:41:56,385 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:56,405 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:56,409 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:56,409 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:89, output treesize:19 [2021-01-07 05:41:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:41:56,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:41:56,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 45 [2021-01-07 05:41:56,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007423702] [2021-01-07 05:41:56,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-01-07 05:41:56,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-01-07 05:41:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1922, Unknown=0, NotChecked=0, Total=2070 [2021-01-07 05:41:56,520 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 46 states. [2021-01-07 05:41:57,626 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2021-01-07 05:41:58,021 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-01-07 05:41:58,323 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2021-01-07 05:41:58,669 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2021-01-07 05:41:59,062 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 104 [2021-01-07 05:41:59,520 WARN L197 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 116 [2021-01-07 05:41:59,940 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 109 [2021-01-07 05:42:00,358 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 111 [2021-01-07 05:42:00,750 WARN L197 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 112 [2021-01-07 05:42:01,132 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 110 [2021-01-07 05:42:01,508 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2021-01-07 05:42:01,890 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2021-01-07 05:42:02,316 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 123 [2021-01-07 05:42:02,912 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 130 [2021-01-07 05:42:03,356 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2021-01-07 05:42:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:42:03,621 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2021-01-07 05:42:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-07 05:42:03,621 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 36 [2021-01-07 05:42:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:42:03,622 INFO L225 Difference]: With dead ends: 92 [2021-01-07 05:42:03,622 INFO L226 Difference]: Without dead ends: 92 [2021-01-07 05:42:03,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1002, Invalid=4110, Unknown=0, NotChecked=0, Total=5112 [2021-01-07 05:42:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-01-07 05:42:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2021-01-07 05:42:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-07 05:42:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2021-01-07 05:42:03,628 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 36 [2021-01-07 05:42:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:42:03,628 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-01-07 05:42:03,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2021-01-07 05:42:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2021-01-07 05:42:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:42:03,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:42:03,629 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:42:03,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 05:42:03,843 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:42:03,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:42:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash 202055510, now seen corresponding path program 1 times [2021-01-07 05:42:03,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:42:03,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157366237] [2021-01-07 05:42:03,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:42:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:42:03,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157366237] [2021-01-07 05:42:03,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328392916] [2021-01-07 05:42:03,913 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 05:42:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:04,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 05:42:04,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:42:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:42:04,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:42:04,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:42:04,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916480251] [2021-01-07 05:42:04,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:42:04,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:42:04,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:42:04,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:42:04,070 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2021-01-07 05:42:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:42:04,100 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2021-01-07 05:42:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:42:04,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2021-01-07 05:42:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:42:04,101 INFO L225 Difference]: With dead ends: 56 [2021-01-07 05:42:04,101 INFO L226 Difference]: Without dead ends: 56 [2021-01-07 05:42:04,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:42:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-01-07 05:42:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-01-07 05:42:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-07 05:42:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2021-01-07 05:42:04,104 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 37 [2021-01-07 05:42:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:42:04,104 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2021-01-07 05:42:04,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:42:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2021-01-07 05:42:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:42:04,109 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:42:04,109 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:42:04,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:42:04,324 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:42:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:42:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash 935157533, now seen corresponding path program 1 times [2021-01-07 05:42:04,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:42:04,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830963660] [2021-01-07 05:42:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:42:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:42:04,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830963660] [2021-01-07 05:42:04,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906951871] [2021-01-07 05:42:04,944 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 05:42:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:05,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 66 conjunts are in the unsatisfiable core [2021-01-07 05:42:05,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:42:05,516 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:42:05,517 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:05,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:05,530 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:05,530 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:28 [2021-01-07 05:42:05,896 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-01-07 05:42:05,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:05,932 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.2 percent of original size [2021-01-07 05:42:05,935 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:05,936 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2021-01-07 05:42:06,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:06,486 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:42:06,486 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 4 case distinctions, treesize of input 47 treesize of output 60 [2021-01-07 05:42:06,489 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:06,515 INFO L625 ElimStorePlain]: treesize reduction 34, result has 53.4 percent of original size [2021-01-07 05:42:06,518 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 05:42:06,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-07 05:42:06,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:06,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:06,726 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:06,726 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 3 case distinctions, treesize of input 37 treesize of output 16 [2021-01-07 05:42:06,727 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:06,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:06,736 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:42:06,736 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:7 [2021-01-07 05:42:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:42:06,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:42:06,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 43 [2021-01-07 05:42:06,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401472174] [2021-01-07 05:42:06,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-07 05:42:06,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:42:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-07 05:42:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1730, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:42:06,774 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 44 states. [2021-01-07 05:42:07,794 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2021-01-07 05:42:07,962 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-01-07 05:42:08,169 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-01-07 05:42:08,398 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2021-01-07 05:42:08,621 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-01-07 05:42:08,853 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2021-01-07 05:42:09,069 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-01-07 05:42:09,266 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2021-01-07 05:42:09,471 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-01-07 05:42:09,674 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2021-01-07 05:42:09,907 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-01-07 05:42:10,191 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2021-01-07 05:42:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:42:10,501 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2021-01-07 05:42:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-07 05:42:10,501 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 39 [2021-01-07 05:42:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:42:10,502 INFO L225 Difference]: With dead ends: 83 [2021-01-07 05:42:10,502 INFO L226 Difference]: Without dead ends: 83 [2021-01-07 05:42:10,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=959, Invalid=3597, Unknown=0, NotChecked=0, Total=4556 [2021-01-07 05:42:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-07 05:42:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2021-01-07 05:42:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-01-07 05:42:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-01-07 05:42:10,507 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 39 [2021-01-07 05:42:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:42:10,507 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-01-07 05:42:10,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-07 05:42:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-01-07 05:42:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:42:10,508 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:42:10,508 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:42:10,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:42:10,717 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:42:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:42:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1074887459, now seen corresponding path program 1 times [2021-01-07 05:42:10,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:42:10,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268075189] [2021-01-07 05:42:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:42:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:42:11,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268075189] [2021-01-07 05:42:11,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901976144] [2021-01-07 05:42:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:42:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:11,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 60 conjunts are in the unsatisfiable core [2021-01-07 05:42:11,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:42:11,458 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:42:11,459 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:11,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:11,466 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:42:11,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-01-07 05:42:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:11,511 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-01-07 05:42:11,512 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:11,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:11,526 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:11,526 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2021-01-07 05:42:11,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:11,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:11,837 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:11,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:42:11,839 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:11,886 INFO L625 ElimStorePlain]: treesize reduction 14, result has 70.8 percent of original size [2021-01-07 05:42:11,887 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:11,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:34 [2021-01-07 05:42:12,307 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:42:12,308 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:12,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:12,341 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:12,341 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:43 [2021-01-07 05:42:13,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:13,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:13,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:13,158 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:13,158 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2021-01-07 05:42:13,160 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:13,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:13,196 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:13,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:62 [2021-01-07 05:42:13,478 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 05:42:13,479 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:13,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:13,515 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 05:42:13,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:58 [2021-01-07 05:42:13,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:13,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:13,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:13,832 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:13,833 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 3 case distinctions, treesize of input 45 treesize of output 41 [2021-01-07 05:42:13,837 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 05:42:13,888 INFO L625 ElimStorePlain]: treesize reduction 15, result has 75.8 percent of original size [2021-01-07 05:42:13,892 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:13,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:38 [2021-01-07 05:42:14,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:14,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2021-01-07 05:42:14,151 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:14,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:14,163 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:42:14,163 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2021-01-07 05:42:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:42:14,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:42:14,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2021-01-07 05:42:14,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245771924] [2021-01-07 05:42:14,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-01-07 05:42:14,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:42:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-01-07 05:42:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1638, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:42:14,216 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 43 states. [2021-01-07 05:42:16,215 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:42:16,442 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2021-01-07 05:42:16,645 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-01-07 05:42:16,929 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-01-07 05:42:17,331 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2021-01-07 05:42:17,893 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2021-01-07 05:42:18,437 WARN L197 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2021-01-07 05:42:18,965 WARN L197 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2021-01-07 05:42:19,488 WARN L197 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2021-01-07 05:42:20,005 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2021-01-07 05:42:20,561 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2021-01-07 05:42:23,048 WARN L197 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2021-01-07 05:42:25,096 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2021-01-07 05:42:25,598 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2021-01-07 05:42:26,071 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2021-01-07 05:42:26,733 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2021-01-07 05:42:27,103 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-01-07 05:42:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:42:27,557 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2021-01-07 05:42:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-07 05:42:27,558 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 40 [2021-01-07 05:42:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:42:27,559 INFO L225 Difference]: With dead ends: 87 [2021-01-07 05:42:27,559 INFO L226 Difference]: Without dead ends: 87 [2021-01-07 05:42:27,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1101, Invalid=4011, Unknown=0, NotChecked=0, Total=5112 [2021-01-07 05:42:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-07 05:42:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2021-01-07 05:42:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-07 05:42:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2021-01-07 05:42:27,563 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 40 [2021-01-07 05:42:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:42:27,564 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-01-07 05:42:27,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2021-01-07 05:42:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2021-01-07 05:42:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:42:27,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:42:27,565 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-01-07 05:42:27,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:42:27,779 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:42:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:42:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1727610515, now seen corresponding path program 2 times [2021-01-07 05:42:27,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:42:27,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898220395] [2021-01-07 05:42:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:42:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:42:27,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898220395] [2021-01-07 05:42:27,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:42:27,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:42:27,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618320054] [2021-01-07 05:42:27,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:42:27,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:42:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:42:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:42:27,841 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 6 states. [2021-01-07 05:42:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:42:27,876 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2021-01-07 05:42:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:42:27,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2021-01-07 05:42:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:42:27,878 INFO L225 Difference]: With dead ends: 50 [2021-01-07 05:42:27,878 INFO L226 Difference]: Without dead ends: 50 [2021-01-07 05:42:27,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:42:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-07 05:42:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-01-07 05:42:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:42:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2021-01-07 05:42:27,880 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2021-01-07 05:42:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:42:27,881 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2021-01-07 05:42:27,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:42:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2021-01-07 05:42:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:42:27,882 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:42:27,882 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:42:27,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 05:42:27,882 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:42:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:42:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2016353083, now seen corresponding path program 2 times [2021-01-07 05:42:27,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:42:27,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852913808] [2021-01-07 05:42:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:42:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:42:28,766 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2021-01-07 05:42:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:42:30,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852913808] [2021-01-07 05:42:30,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425240451] [2021-01-07 05:42:30,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:42:30,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:42:30,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:42:30,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 123 conjunts are in the unsatisfiable core [2021-01-07 05:42:30,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:42:30,246 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:42:30,246 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2021-01-07 05:42:30,250 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:30,269 INFO L625 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2021-01-07 05:42:30,271 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:30,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2021-01-07 05:42:30,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:30,398 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:30,398 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 44 [2021-01-07 05:42:30,402 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:30,443 INFO L625 ElimStorePlain]: treesize reduction 18, result has 60.9 percent of original size [2021-01-07 05:42:30,444 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:30,444 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2021-01-07 05:42:30,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:30,593 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:30,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:42:30,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:30,646 INFO L625 ElimStorePlain]: treesize reduction 18, result has 63.3 percent of original size [2021-01-07 05:42:30,647 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:42:30,647 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:31 [2021-01-07 05:42:31,113 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:42:31,114 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:31,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:31,145 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:42:31,146 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:31,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:31,171 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 05:42:31,171 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2021-01-07 05:42:31,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:31,493 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:31,493 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 74 [2021-01-07 05:42:31,498 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:31,582 INFO L625 ElimStorePlain]: treesize reduction 36, result has 60.0 percent of original size [2021-01-07 05:42:31,583 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:31,584 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:54 [2021-01-07 05:42:31,781 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:31,781 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-07 05:42:31,784 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:31,888 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-01-07 05:42:31,889 INFO L625 ElimStorePlain]: treesize reduction 26, result has 74.5 percent of original size [2021-01-07 05:42:31,927 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:31,927 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-07 05:42:31,929 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:32,026 INFO L625 ElimStorePlain]: treesize reduction 26, result has 73.5 percent of original size [2021-01-07 05:42:32,028 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 05:42:32,028 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:72 [2021-01-07 05:42:32,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:32,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:32,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:32,229 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:32,230 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2021-01-07 05:42:32,232 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:32,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:32,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:32,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:32,309 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:32,310 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2021-01-07 05:42:32,311 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:32,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:32,358 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 05:42:32,358 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:75 [2021-01-07 05:42:32,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:32,933 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:32,933 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2021-01-07 05:42:32,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:33,053 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-01-07 05:42:33,054 INFO L625 ElimStorePlain]: treesize reduction 14, result has 86.8 percent of original size [2021-01-07 05:42:33,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:33,086 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:33,086 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2021-01-07 05:42:33,089 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:33,208 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-07 05:42:33,209 INFO L625 ElimStorePlain]: treesize reduction 14, result has 85.6 percent of original size [2021-01-07 05:42:33,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:33,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:33,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,243 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:33,243 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:95 [2021-01-07 05:42:33,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:33,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:33,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:33,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:42:33,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:33,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:33,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:33,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:35,135 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-01-07 05:42:35,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 10, 1] term [2021-01-07 05:42:35,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:42:35,766 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 05:42:36,123 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-07 05:42:36,486 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2021-01-07 05:42:36,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 11, 1] term [2021-01-07 05:42:36,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:42:36,509 INFO L443 ElimStorePlain]: Different costs {6=[|v_#valid_45|], 10=[v_prenex_4]} [2021-01-07 05:42:36,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:36,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:36,573 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:36,573 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 97 [2021-01-07 05:42:36,576 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:36,831 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2021-01-07 05:42:36,832 INFO L625 ElimStorePlain]: treesize reduction 14, result has 94.2 percent of original size [2021-01-07 05:42:36,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:36,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:37,007 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2021-01-07 05:42:37,008 INFO L348 Elim1Store]: treesize reduction 36, result has 82.4 percent of original size [2021-01-07 05:42:37,008 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 189 [2021-01-07 05:42:37,013 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:37,300 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-01-07 05:42:37,301 INFO L625 ElimStorePlain]: treesize reduction 66, result has 77.9 percent of original size [2021-01-07 05:42:37,305 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-01-07 05:42:37,305 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:221, output treesize:233 [2021-01-07 05:42:37,641 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 05:42:37,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 11, 2, 1] term [2021-01-07 05:42:37,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:42:37,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:37,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:42:37,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:37,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:37,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2021-01-07 05:42:37,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:42:37,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:37,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:42:37,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:42:37,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 05:42:37,687 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_22|], 6=[v_prenex_5], 12=[|v_#memory_$Pointer$.base_24|], 20=[v_prenex_7]} [2021-01-07 05:42:37,699 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-01-07 05:42:37,701 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:37,720 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-01-07 05:42:37,722 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:38,320 WARN L197 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2021-01-07 05:42:38,321 INFO L625 ElimStorePlain]: treesize reduction 16, result has 96.5 percent of original size [2021-01-07 05:42:38,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:38,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2021-01-07 05:42:38,344 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:38,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:38,361 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:38,361 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2021-01-07 05:42:38,363 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:38,610 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-07 05:42:38,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:38,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:38,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:38,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:38,628 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:38,629 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 32 [2021-01-07 05:42:38,630 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:38,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:38,644 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:38,644 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 3 case distinctions, treesize of input 53 treesize of output 41 [2021-01-07 05:42:38,645 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:39,108 WARN L197 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2021-01-07 05:42:39,109 INFO L625 ElimStorePlain]: treesize reduction 13, result has 96.5 percent of original size [2021-01-07 05:42:39,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:39,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:39,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:39,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:39,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:39,142 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:39,142 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 65 [2021-01-07 05:42:39,144 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:39,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:39,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:39,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:39,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:39,179 INFO L348 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-01-07 05:42:39,179 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 76 [2021-01-07 05:42:39,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:42:39,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:42:39,194 INFO L547 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:39,583 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-01-07 05:42:39,584 INFO L625 ElimStorePlain]: treesize reduction 59, result has 83.5 percent of original size [2021-01-07 05:42:39,591 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2021-01-07 05:42:39,591 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:489, output treesize:270 [2021-01-07 05:42:39,954 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-01-07 05:42:40,422 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-01-07 05:42:41,173 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 103 [2021-01-07 05:42:41,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 4, 11, 1] term [2021-01-07 05:42:41,193 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 05:42:41,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 12, 1] term [2021-01-07 05:42:41,196 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:42:41,772 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 85 [2021-01-07 05:42:42,172 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-01-07 05:42:42,623 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-01-07 05:42:43,090 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-07 05:42:43,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 13, 1] term [2021-01-07 05:42:43,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:43,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:42:43,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:42:43,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:43,137 INFO L443 ElimStorePlain]: Different costs {10=[|v_#valid_46|], 15=[v_prenex_11]} [2021-01-07 05:42:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:43,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:43,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:43,186 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:43,187 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 63 [2021-01-07 05:42:43,189 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:43,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:43,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:43,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:43,206 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-01-07 05:42:43,207 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:43,616 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2021-01-07 05:42:43,617 INFO L625 ElimStorePlain]: treesize reduction 167, result has 62.6 percent of original size [2021-01-07 05:42:43,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:43,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:43,704 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:43,705 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 113 [2021-01-07 05:42:43,708 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:44,097 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-01-07 05:42:44,098 INFO L625 ElimStorePlain]: treesize reduction 18, result has 94.1 percent of original size [2021-01-07 05:42:44,103 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2021-01-07 05:42:44,103 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:599, output treesize:286 [2021-01-07 05:42:44,541 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-07 05:42:44,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 13, 2, 1] term [2021-01-07 05:42:44,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:42:44,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 10, 2, 1] term [2021-01-07 05:42:44,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:42:44,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:42:44,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 05:42:44,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2021-01-07 05:42:44,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:42:44,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:42:44,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:42:44,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 17 disjuncts [2021-01-07 05:42:44,617 INFO L443 ElimStorePlain]: Different costs {3=[|#valid|], 6=[v_prenex_14]} [2021-01-07 05:42:44,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:44,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:44,637 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-01-07 05:42:44,638 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:44,879 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2021-01-07 05:42:44,881 INFO L625 ElimStorePlain]: treesize reduction 168, result has 48.0 percent of original size [2021-01-07 05:42:44,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:44,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:44,912 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:44,912 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2021-01-07 05:42:44,914 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:44,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:44,983 INFO L443 ElimStorePlain]: Different costs {12=[v_prenex_12, |v_#memory_$Pointer$.offset_23|], 20=[v_prenex_13, |v_#memory_$Pointer$.base_25|]} [2021-01-07 05:42:44,995 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:44,995 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 76 [2021-01-07 05:42:45,001 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:45,100 INFO L625 ElimStorePlain]: treesize reduction 24, result has 83.3 percent of original size [2021-01-07 05:42:45,100 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_23| vanished before elimination [2021-01-07 05:42:45,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:45,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:45,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:45,127 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:45,127 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 97 [2021-01-07 05:42:45,131 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:45,231 INFO L625 ElimStorePlain]: treesize reduction 57, result has 66.5 percent of original size [2021-01-07 05:42:45,232 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_25| vanished before elimination [2021-01-07 05:42:45,236 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:42:45,236 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:470, output treesize:113 [2021-01-07 05:42:45,498 INFO L443 ElimStorePlain]: Different costs {4=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2021-01-07 05:42:45,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:45,505 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 10 [2021-01-07 05:42:45,506 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:45,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:45,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:42:45,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:42:45,564 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:45,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 29 [2021-01-07 05:42:45,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:42:45,569 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:42:45,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:42:45,596 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:42:45,597 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:124, output treesize:7 [2021-01-07 05:42:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:42:45,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:42:45,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 65 [2021-01-07 05:42:45,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363180404] [2021-01-07 05:42:45,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-01-07 05:42:45,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:42:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-01-07 05:42:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3948, Unknown=0, NotChecked=0, Total=4160 [2021-01-07 05:42:45,646 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 65 states. [2021-01-07 05:42:46,630 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-01-07 05:42:46,922 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-01-07 05:42:47,353 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2021-01-07 05:42:47,667 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2021-01-07 05:42:48,094 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2021-01-07 05:42:48,556 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2021-01-07 05:42:48,982 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 68 [2021-01-07 05:42:49,330 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2021-01-07 05:42:49,672 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2021-01-07 05:42:50,226 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 82 [2021-01-07 05:42:50,789 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2021-01-07 05:42:51,552 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2021-01-07 05:42:52,284 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 112 [2021-01-07 05:42:53,163 WARN L197 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 117 [2021-01-07 05:42:54,863 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 181 DAG size of output: 113 [2021-01-07 05:42:55,675 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 117 [2021-01-07 05:42:56,520 WARN L197 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 118 [2021-01-07 05:42:57,079 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2021-01-07 05:42:57,747 WARN L197 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 136 [2021-01-07 05:42:58,339 WARN L197 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 119 [2021-01-07 05:42:59,006 WARN L197 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 125 [2021-01-07 05:42:59,674 WARN L197 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 123 [2021-01-07 05:43:00,180 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2021-01-07 05:43:00,776 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 122 [2021-01-07 05:43:01,384 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 123 [2021-01-07 05:43:01,822 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-01-07 05:43:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:43:02,536 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2021-01-07 05:43:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-01-07 05:43:02,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 47 [2021-01-07 05:43:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:43:02,537 INFO L225 Difference]: With dead ends: 88 [2021-01-07 05:43:02,537 INFO L226 Difference]: Without dead ends: 88 [2021-01-07 05:43:02,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=679, Invalid=8633, Unknown=0, NotChecked=0, Total=9312 [2021-01-07 05:43:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-01-07 05:43:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2021-01-07 05:43:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:43:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2021-01-07 05:43:02,542 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 47 [2021-01-07 05:43:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:43:02,542 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2021-01-07 05:43:02,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2021-01-07 05:43:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2021-01-07 05:43:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:43:02,543 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:43:02,543 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:43:02,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:43:02,758 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:43:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:43:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2016353018, now seen corresponding path program 1 times [2021-01-07 05:43:02,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:43:02,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172763757] [2021-01-07 05:43:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:43:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:43:03,963 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2021-01-07 05:43:04,204 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2021-01-07 05:43:04,411 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2021-01-07 05:43:04,625 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2021-01-07 05:43:04,850 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 28 [2021-01-07 05:43:05,069 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2021-01-07 05:43:05,284 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 21 [2021-01-07 05:43:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:43:05,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172763757] [2021-01-07 05:43:05,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343360563] [2021-01-07 05:43:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:43:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:43:06,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 88 conjunts are in the unsatisfiable core [2021-01-07 05:43:06,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:43:06,063 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:43:06,064 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2021-01-07 05:43:06,065 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:43:06,090 INFO L625 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2021-01-07 05:43:06,092 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:43:06,092 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2021-01-07 05:43:07,700 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:43:07,704 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:43:07,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:43:07,774 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:43:07,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:86, output treesize:97 [2021-01-07 05:43:09,525 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-01-07 05:43:09,526 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:43:09,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:43:09,616 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 05:43:09,616 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:166, output treesize:155 [2021-01-07 05:43:10,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:43:10,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:43:10,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:43:10,462 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:43:10,463 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 3 case distinctions, treesize of input 118 treesize of output 72 [2021-01-07 05:43:10,466 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 05:43:10,639 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-01-07 05:43:10,639 INFO L625 ElimStorePlain]: treesize reduction 13, result has 89.4 percent of original size [2021-01-07 05:43:10,643 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:43:10,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:148, output treesize:110 [2021-01-07 05:43:11,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:43:11,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:43:11,790 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 80 treesize of output 42 [2021-01-07 05:43:11,792 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:43:11,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:43:11,851 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:43:11,852 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:123, output treesize:64 [2021-01-07 05:43:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:43:12,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:43:12,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 56 [2021-01-07 05:43:12,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734588796] [2021-01-07 05:43:12,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-01-07 05:43:12,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:43:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-01-07 05:43:12,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2021-01-07 05:43:12,862 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 57 states. [2021-01-07 05:43:13,710 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2021-01-07 05:43:14,060 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2021-01-07 05:43:14,711 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2021-01-07 05:43:15,127 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2021-01-07 05:43:15,661 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-01-07 05:43:16,070 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-01-07 05:43:16,831 WARN L197 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2021-01-07 05:43:17,753 WARN L197 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-01-07 05:43:18,779 WARN L197 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 [2021-01-07 05:43:19,897 WARN L197 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 94 [2021-01-07 05:43:21,034 WARN L197 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2021-01-07 05:43:22,200 WARN L197 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 95 [2021-01-07 05:43:23,369 WARN L197 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-07 05:43:24,511 WARN L197 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2021-01-07 05:43:25,400 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-01-07 05:43:26,997 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2021-01-07 05:43:28,146 WARN L197 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-01-07 05:43:29,391 WARN L197 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-01-07 05:43:32,312 WARN L197 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2021-01-07 05:43:35,225 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 111 DAG size of output: 104 [2021-01-07 05:43:37,527 WARN L197 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2021-01-07 05:43:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:43:38,431 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2021-01-07 05:43:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-07 05:43:38,433 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 47 [2021-01-07 05:43:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:43:38,433 INFO L225 Difference]: With dead ends: 85 [2021-01-07 05:43:38,433 INFO L226 Difference]: Without dead ends: 59 [2021-01-07 05:43:38,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=537, Invalid=6105, Unknown=0, NotChecked=0, Total=6642 [2021-01-07 05:43:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-01-07 05:43:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-01-07 05:43:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-01-07 05:43:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2021-01-07 05:43:38,437 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 47 [2021-01-07 05:43:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:43:38,437 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2021-01-07 05:43:38,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2021-01-07 05:43:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2021-01-07 05:43:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:43:38,438 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:43:38,438 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:43:38,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-07 05:43:38,639 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:43:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:43:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1757894151, now seen corresponding path program 3 times [2021-01-07 05:43:38,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:43:38,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260981058] [2021-01-07 05:43:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:43:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:43:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:43:38,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260981058] [2021-01-07 05:43:38,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004732497] [2021-01-07 05:43:38,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:43:39,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-07 05:43:39,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:43:39,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 05:43:39,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:43:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:43:39,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:43:39,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-01-07 05:43:39,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308773536] [2021-01-07 05:43:39,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:43:39,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:43:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:43:39,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:43:39,321 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 5 states. [2021-01-07 05:43:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:43:39,336 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2021-01-07 05:43:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:43:39,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2021-01-07 05:43:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:43:39,338 INFO L225 Difference]: With dead ends: 21 [2021-01-07 05:43:39,338 INFO L226 Difference]: Without dead ends: 0 [2021-01-07 05:43:39,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 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 05:43:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-07 05:43:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-07 05:43:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-07 05:43:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-07 05:43:39,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2021-01-07 05:43:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:43:39,339 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-07 05:43:39,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:43:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-07 05:43:39,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-07 05:43:39,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 05:43:39,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 05:43:39 BoogieIcfgContainer [2021-01-07 05:43:39,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 05:43:39,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 05:43:39,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 05:43:39,550 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 05:43:39,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:41:37" (3/4) ... [2021-01-07 05:43:39,555 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-07 05:43:39,568 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-01-07 05:43:39,569 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-01-07 05:43:39,569 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-01-07 05:43:39,569 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-07 05:43:39,614 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-simple/sll2n_remove_all.i-witness.graphml [2021-01-07 05:43:39,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 05:43:39,615 INFO L168 Benchmark]: Toolchain (without parser) took 123331.63 ms. Allocated memory was 151.0 MB in the beginning and 323.0 MB in the end (delta: 172.0 MB). Free memory was 125.9 MB in the beginning and 248.7 MB in the end (delta: -122.9 MB). Peak memory consumption was 50.7 MB. Max. memory is 8.0 GB. [2021-01-07 05:43:39,616 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:43:39,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.99 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 103.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:43:39,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.88 ms. Allocated memory is still 151.0 MB. Free memory was 103.1 MB in the beginning and 134.9 MB in the end (delta: -31.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 8.0 GB. [2021-01-07 05:43:39,617 INFO L168 Benchmark]: Boogie Preprocessor took 45.92 ms. Allocated memory is still 151.0 MB. Free memory was 134.9 MB in the beginning and 133.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:43:39,617 INFO L168 Benchmark]: RCFGBuilder took 627.55 ms. Allocated memory is still 151.0 MB. Free memory was 133.1 MB in the beginning and 109.5 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:43:39,617 INFO L168 Benchmark]: TraceAbstraction took 121781.64 ms. Allocated memory was 151.0 MB in the beginning and 323.0 MB in the end (delta: 172.0 MB). Free memory was 109.0 MB in the beginning and 251.9 MB in the end (delta: -142.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 8.0 GB. [2021-01-07 05:43:39,618 INFO L168 Benchmark]: Witness Printer took 64.28 ms. Allocated memory is still 323.0 MB. Free memory was 251.9 MB in the beginning and 248.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:43:39,620 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 666.99 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 103.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 123.88 ms. Allocated memory is still 151.0 MB. Free memory was 103.1 MB in the beginning and 134.9 MB in the end (delta: -31.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.92 ms. Allocated memory is still 151.0 MB. Free memory was 134.9 MB in the beginning and 133.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 627.55 ms. Allocated memory is still 151.0 MB. Free memory was 133.1 MB in the beginning and 109.5 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 121781.64 ms. Allocated memory was 151.0 MB in the beginning and 323.0 MB in the end (delta: 172.0 MB). Free memory was 109.0 MB in the beginning and 251.9 MB in the end (delta: -142.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 8.0 GB. * Witness Printer took 64.28 ms. Allocated memory is still 323.0 MB. Free memory was 251.9 MB in the beginning and 248.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 597]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 21 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 121.6s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 73.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 667 SDtfs, 5611 SDslu, 2403 SDs, 0 SdLazy, 6771 SolverSat, 825 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 301 SyntacticMatches, 12 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7097 ImplicationChecksByTransitivity, 84.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 284 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 42.4s InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1155 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1118 ConstructedInterpolants, 196 QuantifiedInterpolants, 947407 SizeOfPredicates, 235 NumberOfNonLiveVariables, 2794 ConjunctsInSsa, 530 ConjunctsInUnsatCore, 37 InterpolantComputations, 16 PerfectInterpolantSequences, 289/499 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...