/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/array-memsafety/cstrcspn-alloca-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:00:15,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:00:15,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:00:15,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:00:15,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:00:15,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:00:15,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:00:15,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:00:15,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:00:15,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:00:15,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:00:15,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:00:15,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:00:15,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:00:15,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:00:15,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:00:15,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:00:15,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:00:15,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:00:15,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:00:15,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:00:15,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:00:15,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:00:15,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:00:15,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:00:15,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:00:15,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:00:15,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:00:15,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:00:15,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:00:15,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:00:15,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:00:15,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:00:15,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:00:15,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:00:15,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:00:15,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:00:15,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:00:15,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:00:15,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:00:15,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:00:15,646 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:00:15,697 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:00:15,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:00:15,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:00:15,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:00:15,703 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:00:15,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:00:15,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:00:15,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:00:15,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:00:15,705 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:00:15,707 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:00:15,707 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:00:15,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:00:15,708 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:00:15,708 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:00:15,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:00:15,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:00:15,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:00:15,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:00:15,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:00:15,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:00:15,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:00:15,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:00:15,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:00:15,711 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:00:16,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:00:16,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:00:16,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:00:16,194 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:00:16,195 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:00:16,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2021-01-07 05:00:16,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9805edfd0/17bc09b48b574e1a914f1d65a970ce2a/FLAG72717c093 [2021-01-07 05:00:17,012 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:00:17,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2021-01-07 05:00:17,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9805edfd0/17bc09b48b574e1a914f1d65a970ce2a/FLAG72717c093 [2021-01-07 05:00:17,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9805edfd0/17bc09b48b574e1a914f1d65a970ce2a [2021-01-07 05:00:17,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:00:17,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:00:17,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:00:17,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:00:17,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:00:17,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:00:17" (1/1) ... [2021-01-07 05:00:17,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d28225e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:17, skipping insertion in model container [2021-01-07 05:00:17,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:00:17" (1/1) ... [2021-01-07 05:00:17,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:00:17,438 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~sc1~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: lhs: VariableLHS[~length1~0,] left hand side expression in assignment: lhs: VariableLHS[~length2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],IdentifierExpression[~i~1,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length1~0,],IntegerLiteral[1]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length2~0,],IntegerLiteral[1]]]]] [2021-01-07 05:00:17,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:00:17,908 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~sc1~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: lhs: VariableLHS[~length1~0,] left hand side expression in assignment: lhs: VariableLHS[~length2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],IdentifierExpression[~i~1,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length1~0,],IntegerLiteral[1]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length2~0,],IntegerLiteral[1]]]]] [2021-01-07 05:00:17,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:00:18,010 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:00:18,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18 WrapperNode [2021-01-07 05:00:18,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:00:18,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:00:18,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:00:18,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:00:18,022 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:00:18" (1/1) ... [2021-01-07 05:00:18,038 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:00:18" (1/1) ... [2021-01-07 05:00:18,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:00:18,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:00:18,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:00:18,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:00:18,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... [2021-01-07 05:00:18,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... [2021-01-07 05:00:18,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... [2021-01-07 05:00:18,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... [2021-01-07 05:00:18,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... [2021-01-07 05:00:18,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... [2021-01-07 05:00:18,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... [2021-01-07 05:00:18,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:00:18,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:00:18,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:00:18,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:00:18,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:00:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:00:18,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:00:18,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:00:18,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:00:18,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:00:18,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:00:18,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:00:18,795 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-07 05:00:18,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:00:18 BoogieIcfgContainer [2021-01-07 05:00:18,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:00:18,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:00:18,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:00:18,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:00:18,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:00:17" (1/3) ... [2021-01-07 05:00:18,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ef3abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:00:18, skipping insertion in model container [2021-01-07 05:00:18,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:00:18" (2/3) ... [2021-01-07 05:00:18,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ef3abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:00:18, skipping insertion in model container [2021-01-07 05:00:18,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:00:18" (3/3) ... [2021-01-07 05:00:18,806 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2021-01-07 05:00:18,813 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:00:18,819 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2021-01-07 05:00:18,841 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2021-01-07 05:00:18,863 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:00:18,863 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:00:18,863 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:00:18,863 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:00:18,864 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:00:18,864 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:00:18,864 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:00:18,864 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:00:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2021-01-07 05:00:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:00:18,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:18,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:18,888 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2021-01-07 05:00:18,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:18,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120249724] [2021-01-07 05:00:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,113 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:00:19,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120249724] [2021-01-07 05:00:19,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:19,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989575614] [2021-01-07 05:00:19,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:19,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:19,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:19,142 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 4 states. [2021-01-07 05:00:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,205 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2021-01-07 05:00:19,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:19,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2021-01-07 05:00:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,218 INFO L225 Difference]: With dead ends: 100 [2021-01-07 05:00:19,218 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:00:19,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:00:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2021-01-07 05:00:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-07 05:00:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-01-07 05:00:19,258 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 7 [2021-01-07 05:00:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,258 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-01-07 05:00:19,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-01-07 05:00:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:00:19,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:00:19,260 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2021-01-07 05:00:19,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485318468] [2021-01-07 05:00:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,316 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:00:19,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485318468] [2021-01-07 05:00:19,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:00:19,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357408055] [2021-01-07 05:00:19,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:00:19,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:00:19,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:00:19,321 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 3 states. [2021-01-07 05:00:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,394 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-01-07 05:00:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:00:19,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-07 05:00:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,396 INFO L225 Difference]: With dead ends: 53 [2021-01-07 05:00:19,397 INFO L226 Difference]: Without dead ends: 53 [2021-01-07 05:00:19,397 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:00:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-01-07 05:00:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-01-07 05:00:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:00:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-01-07 05:00:19,404 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 7 [2021-01-07 05:00:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,405 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-01-07 05:00:19,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:00:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-01-07 05:00:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:00:19,406 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:00:19,407 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2021-01-07 05:00:19,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213902461] [2021-01-07 05:00:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,505 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:00:19,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213902461] [2021-01-07 05:00:19,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:19,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268040894] [2021-01-07 05:00:19,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:19,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:19,509 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2021-01-07 05:00:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,643 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2021-01-07 05:00:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:19,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2021-01-07 05:00:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,645 INFO L225 Difference]: With dead ends: 97 [2021-01-07 05:00:19,646 INFO L226 Difference]: Without dead ends: 97 [2021-01-07 05:00:19,646 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:00:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-01-07 05:00:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2021-01-07 05:00:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-07 05:00:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-01-07 05:00:19,654 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 7 [2021-01-07 05:00:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,655 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-01-07 05:00:19,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2021-01-07 05:00:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:00:19,656 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:00:19,656 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2021-01-07 05:00:19,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829633876] [2021-01-07 05:00:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,716 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:00:19,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829633876] [2021-01-07 05:00:19,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:19,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215635035] [2021-01-07 05:00:19,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:19,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:19,719 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2021-01-07 05:00:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,783 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-01-07 05:00:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:19,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-01-07 05:00:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,784 INFO L225 Difference]: With dead ends: 54 [2021-01-07 05:00:19,785 INFO L226 Difference]: Without dead ends: 54 [2021-01-07 05:00:19,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-07 05:00:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-01-07 05:00:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-07 05:00:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2021-01-07 05:00:19,790 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2021-01-07 05:00:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,791 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-01-07 05:00:19,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-01-07 05:00:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:00:19,792 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:00:19,792 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2021-01-07 05:00:19,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021618616] [2021-01-07 05:00:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,829 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:00:19,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021618616] [2021-01-07 05:00:19,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:19,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835456062] [2021-01-07 05:00:19,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:19,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:19,832 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 4 states. [2021-01-07 05:00:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,855 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2021-01-07 05:00:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:19,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-01-07 05:00:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,857 INFO L225 Difference]: With dead ends: 98 [2021-01-07 05:00:19,857 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:00:19,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:00:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2021-01-07 05:00:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-01-07 05:00:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-01-07 05:00:19,867 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 9 [2021-01-07 05:00:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,867 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-01-07 05:00:19,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-01-07 05:00:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:00:19,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:00:19,872 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2021-01-07 05:00:19,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830991157] [2021-01-07 05:00:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,934 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:00:19,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830991157] [2021-01-07 05:00:19,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:00:19,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544328415] [2021-01-07 05:00:19,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:00:19,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:00:19,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:00:19,938 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 3 states. [2021-01-07 05:00:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,972 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2021-01-07 05:00:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:00:19,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-07 05:00:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,974 INFO L225 Difference]: With dead ends: 63 [2021-01-07 05:00:19,974 INFO L226 Difference]: Without dead ends: 63 [2021-01-07 05:00:19,975 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:00:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-01-07 05:00:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-01-07 05:00:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-01-07 05:00:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2021-01-07 05:00:19,991 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 9 [2021-01-07 05:00:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,995 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2021-01-07 05:00:19,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:00:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2021-01-07 05:00:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:00:19,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:00:19,997 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2021-01-07 05:00:19,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029636526] [2021-01-07 05:00:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,105 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:00:20,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029636526] [2021-01-07 05:00:20,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:20,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843879826] [2021-01-07 05:00:20,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:20,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:20,115 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 5 states. [2021-01-07 05:00:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,235 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2021-01-07 05:00:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:20,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-01-07 05:00:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,236 INFO L225 Difference]: With dead ends: 98 [2021-01-07 05:00:20,236 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:00:20,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:00:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:00:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2021-01-07 05:00:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-01-07 05:00:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-01-07 05:00:20,243 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 9 [2021-01-07 05:00:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,243 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-01-07 05:00:20,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-01-07 05:00:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:00:20,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:00:20,245 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:20,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2021-01-07 05:00:20,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786063641] [2021-01-07 05:00:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,301 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:00:20,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786063641] [2021-01-07 05:00:20,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:20,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497203330] [2021-01-07 05:00:20,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:20,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:20,304 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2021-01-07 05:00:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,351 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2021-01-07 05:00:20,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:20,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 05:00:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,352 INFO L225 Difference]: With dead ends: 64 [2021-01-07 05:00:20,353 INFO L226 Difference]: Without dead ends: 64 [2021-01-07 05:00:20,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-01-07 05:00:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-01-07 05:00:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-07 05:00:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2021-01-07 05:00:20,357 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 10 [2021-01-07 05:00:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,358 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2021-01-07 05:00:20,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2021-01-07 05:00:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:00:20,359 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,359 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:00:20,359 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2021-01-07 05:00:20,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641837067] [2021-01-07 05:00:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:20,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641837067] [2021-01-07 05:00:20,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760221110] [2021-01-07 05:00:20,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:00:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-07 05:00:20,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:20,568 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_30|]} [2021-01-07 05:00:20,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:20,587 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:00:20,589 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:20,599 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:20,607 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:00:20,614 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:20,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:20,626 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:20,626 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2021-01-07 05:00:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:20,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:20,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 05:00:20,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552419383] [2021-01-07 05:00:20,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:00:20,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:00:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:00:20,663 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 6 states. [2021-01-07 05:00:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,821 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2021-01-07 05:00:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:20,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-07 05:00:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,822 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:00:20,822 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:00:20,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:00:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2021-01-07 05:00:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-01-07 05:00:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-01-07 05:00:20,828 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 11 [2021-01-07 05:00:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,828 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-01-07 05:00:20,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:00:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-01-07 05:00:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-07 05:00:20,829 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:21,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-07 05:00:21,044 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash -464624131, now seen corresponding path program 1 times [2021-01-07 05:00:21,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:21,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984903016] [2021-01-07 05:00:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:21,088 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:00:21,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984903016] [2021-01-07 05:00:21,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:21,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:21,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633625999] [2021-01-07 05:00:21,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:21,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:21,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:21,091 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 4 states. [2021-01-07 05:00:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:21,142 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2021-01-07 05:00:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:21,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-01-07 05:00:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:21,143 INFO L225 Difference]: With dead ends: 57 [2021-01-07 05:00:21,143 INFO L226 Difference]: Without dead ends: 57 [2021-01-07 05:00:21,144 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:00:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-01-07 05:00:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-01-07 05:00:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-07 05:00:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2021-01-07 05:00:21,147 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 12 [2021-01-07 05:00:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:21,147 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2021-01-07 05:00:21,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2021-01-07 05:00:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-07 05:00:21,148 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:21,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:21,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:00:21,149 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash -464624130, now seen corresponding path program 1 times [2021-01-07 05:00:21,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:21,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775459464] [2021-01-07 05:00:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:21,208 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:00:21,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775459464] [2021-01-07 05:00:21,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:21,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:00:21,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339168115] [2021-01-07 05:00:21,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:00:21,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:21,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:00:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:00:21,211 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 6 states. [2021-01-07 05:00:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:21,310 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2021-01-07 05:00:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:21,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2021-01-07 05:00:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:21,311 INFO L225 Difference]: With dead ends: 80 [2021-01-07 05:00:21,312 INFO L226 Difference]: Without dead ends: 80 [2021-01-07 05:00:21,312 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:00:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-07 05:00:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2021-01-07 05:00:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-07 05:00:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2021-01-07 05:00:21,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 12 [2021-01-07 05:00:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:21,316 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2021-01-07 05:00:21,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:00:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2021-01-07 05:00:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:00:21,317 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:21,317 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:21,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:00:21,317 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2021-01-07 05:00:21,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:21,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078978315] [2021-01-07 05:00:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:21,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078978315] [2021-01-07 05:00:21,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871224874] [2021-01-07 05:00:21,381 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:00:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:21,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 05:00:21,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:21,454 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:21,455 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:00:21,457 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:21,474 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:00:21,477 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:21,477 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:00:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:21,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:21,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:00:21,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083886291] [2021-01-07 05:00:21,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:00:21,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:00:21,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:21,539 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 7 states. [2021-01-07 05:00:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:21,677 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2021-01-07 05:00:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:00:21,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2021-01-07 05:00:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:21,679 INFO L225 Difference]: With dead ends: 92 [2021-01-07 05:00:21,679 INFO L226 Difference]: Without dead ends: 92 [2021-01-07 05:00:21,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:00:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-01-07 05:00:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2021-01-07 05:00:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-07 05:00:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2021-01-07 05:00:21,686 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 13 [2021-01-07 05:00:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:21,687 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2021-01-07 05:00:21,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:00:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2021-01-07 05:00:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:00:21,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:21,689 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:00:21,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 05:00:21,904 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1433224404, now seen corresponding path program 1 times [2021-01-07 05:00:21,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:21,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332641114] [2021-01-07 05:00:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,043 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:00:22,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332641114] [2021-01-07 05:00:22,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:22,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:22,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664661642] [2021-01-07 05:00:22,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:22,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:22,046 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 4 states. [2021-01-07 05:00:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,084 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2021-01-07 05:00:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:22,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-01-07 05:00:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,085 INFO L225 Difference]: With dead ends: 56 [2021-01-07 05:00:22,085 INFO L226 Difference]: Without dead ends: 53 [2021-01-07 05:00:22,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-01-07 05:00:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-01-07 05:00:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:00:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-01-07 05:00:22,088 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 16 [2021-01-07 05:00:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,090 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-01-07 05:00:22,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-01-07 05:00:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:00:22,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,092 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:00:22,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:00:22,093 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1433207485, now seen corresponding path program 1 times [2021-01-07 05:00:22,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:22,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9670582] [2021-01-07 05:00:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,154 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:00:22,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9670582] [2021-01-07 05:00:22,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:22,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:22,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264412821] [2021-01-07 05:00:22,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:22,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:22,161 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2021-01-07 05:00:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,230 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2021-01-07 05:00:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:22,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:00:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,232 INFO L225 Difference]: With dead ends: 50 [2021-01-07 05:00:22,232 INFO L226 Difference]: Without dead ends: 50 [2021-01-07 05:00:22,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-07 05:00:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-01-07 05:00:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:00:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-01-07 05:00:22,237 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 16 [2021-01-07 05:00:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,237 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-01-07 05:00:22,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-01-07 05:00:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:00:22,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,242 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:00:22,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:00:22,242 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1433207484, now seen corresponding path program 1 times [2021-01-07 05:00:22,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:22,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963413042] [2021-01-07 05:00:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,361 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:00:22,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963413042] [2021-01-07 05:00:22,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:22,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:00:22,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49236554] [2021-01-07 05:00:22,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:00:22,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:00:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:22,364 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 7 states. [2021-01-07 05:00:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,462 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2021-01-07 05:00:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:00:22,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-01-07 05:00:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,464 INFO L225 Difference]: With dead ends: 62 [2021-01-07 05:00:22,464 INFO L226 Difference]: Without dead ends: 62 [2021-01-07 05:00:22,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:00:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-01-07 05:00:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2021-01-07 05:00:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-07 05:00:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2021-01-07 05:00:22,468 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 16 [2021-01-07 05:00:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,469 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2021-01-07 05:00:22,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:00:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2021-01-07 05:00:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:00:22,470 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:22,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:00:22,471 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash 43271131, now seen corresponding path program 1 times [2021-01-07 05:00:22,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:22,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072126897] [2021-01-07 05:00:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:22,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072126897] [2021-01-07 05:00:22,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:22,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:22,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163062470] [2021-01-07 05:00:22,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:00:22,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:00:22,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:00:22,513 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 3 states. [2021-01-07 05:00:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,522 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2021-01-07 05:00:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:00:22,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-07 05:00:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,523 INFO L225 Difference]: With dead ends: 59 [2021-01-07 05:00:22,523 INFO L226 Difference]: Without dead ends: 59 [2021-01-07 05:00:22,525 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:00:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-01-07 05:00:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-01-07 05:00:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-01-07 05:00:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-01-07 05:00:22,529 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 20 [2021-01-07 05:00:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,530 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-01-07 05:00:22,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:00:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-01-07 05:00:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:00:22,532 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:22,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:00:22,532 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1371974184, now seen corresponding path program 1 times [2021-01-07 05:00:22,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:22,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972428944] [2021-01-07 05:00:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:22,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972428944] [2021-01-07 05:00:22,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:22,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:00:22,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422352401] [2021-01-07 05:00:22,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:00:22,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:00:22,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:22,676 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 7 states. [2021-01-07 05:00:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,800 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2021-01-07 05:00:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:00:22,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2021-01-07 05:00:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,801 INFO L225 Difference]: With dead ends: 71 [2021-01-07 05:00:22,802 INFO L226 Difference]: Without dead ends: 54 [2021-01-07 05:00:22,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:00:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-07 05:00:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-01-07 05:00:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-07 05:00:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2021-01-07 05:00:22,804 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 22 [2021-01-07 05:00:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,805 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2021-01-07 05:00:22,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:00:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2021-01-07 05:00:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:00:22,805 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:22,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:00:22,806 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2105344662, now seen corresponding path program 1 times [2021-01-07 05:00:22,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:22,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664616871] [2021-01-07 05:00:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:22,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664616871] [2021-01-07 05:00:22,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:22,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:00:22,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506423368] [2021-01-07 05:00:22,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:00:22,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:00:22,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:00:22,984 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 8 states. [2021-01-07 05:00:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:23,136 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2021-01-07 05:00:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:00:23,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2021-01-07 05:00:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:23,139 INFO L225 Difference]: With dead ends: 74 [2021-01-07 05:00:23,139 INFO L226 Difference]: Without dead ends: 62 [2021-01-07 05:00:23,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:00:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-01-07 05:00:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2021-01-07 05:00:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-07 05:00:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2021-01-07 05:00:23,146 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 22 [2021-01-07 05:00:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:23,146 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2021-01-07 05:00:23,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:00:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2021-01-07 05:00:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:00:23,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:23,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:23,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:00:23,150 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:23,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1877695219, now seen corresponding path program 1 times [2021-01-07 05:00:23,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:23,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305870300] [2021-01-07 05:00:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:23,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305870300] [2021-01-07 05:00:23,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:23,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:00:23,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401904547] [2021-01-07 05:00:23,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:00:23,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:23,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:00:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:00:23,285 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 9 states. [2021-01-07 05:00:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:23,449 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2021-01-07 05:00:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:00:23,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2021-01-07 05:00:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:23,450 INFO L225 Difference]: With dead ends: 75 [2021-01-07 05:00:23,450 INFO L226 Difference]: Without dead ends: 75 [2021-01-07 05:00:23,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:00:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-07 05:00:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-01-07 05:00:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-07 05:00:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-01-07 05:00:23,454 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2021-01-07 05:00:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:23,454 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-01-07 05:00:23,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:00:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-01-07 05:00:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:00:23,457 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:23,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:23,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:00:23,457 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash 72256885, now seen corresponding path program 1 times [2021-01-07 05:00:23,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:23,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091883042] [2021-01-07 05:00:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:23,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091883042] [2021-01-07 05:00:23,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:23,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 05:00:23,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331088158] [2021-01-07 05:00:23,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:00:23,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:00:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:00:23,692 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 11 states. [2021-01-07 05:00:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:23,963 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2021-01-07 05:00:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:00:23,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2021-01-07 05:00:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:23,965 INFO L225 Difference]: With dead ends: 96 [2021-01-07 05:00:23,966 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:00:23,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:00:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:00:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2021-01-07 05:00:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-07 05:00:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2021-01-07 05:00:23,971 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 26 [2021-01-07 05:00:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:23,971 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2021-01-07 05:00:23,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:00:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2021-01-07 05:00:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:00:23,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:23,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:23,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:00:23,973 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1740534735, now seen corresponding path program 1 times [2021-01-07 05:00:23,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:23,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705949308] [2021-01-07 05:00:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:24,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705949308] [2021-01-07 05:00:24,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650522765] [2021-01-07 05:00:24,097 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:00:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:24,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-07 05:00:24,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:24,196 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_31|]} [2021-01-07 05:00:24,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:24,202 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-01-07 05:00:24,203 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:24,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:24,218 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:00:24,220 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:24,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:24,235 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:24,235 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2021-01-07 05:00:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:24,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:24,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-01-07 05:00:24,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910087882] [2021-01-07 05:00:24,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:00:24,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:00:24,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:00:24,363 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 12 states. [2021-01-07 05:00:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:24,685 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2021-01-07 05:00:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:00:24,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2021-01-07 05:00:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:24,688 INFO L225 Difference]: With dead ends: 146 [2021-01-07 05:00:24,688 INFO L226 Difference]: Without dead ends: 146 [2021-01-07 05:00:24,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:00:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-01-07 05:00:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 107. [2021-01-07 05:00:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 05:00:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2021-01-07 05:00:24,694 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 27 [2021-01-07 05:00:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:24,695 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2021-01-07 05:00:24,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:00:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2021-01-07 05:00:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:00:24,696 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:24,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:24,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:24,910 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash -145898734, now seen corresponding path program 1 times [2021-01-07 05:00:24,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:24,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101581255] [2021-01-07 05:00:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:25,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101581255] [2021-01-07 05:00:25,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225154865] [2021-01-07 05:00:25,081 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:00:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:25,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-07 05:00:25,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:25,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:25,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-01-07 05:00:25,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550159727] [2021-01-07 05:00:25,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:00:25,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:25,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:00:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:00:25,298 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 16 states. [2021-01-07 05:00:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:25,651 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2021-01-07 05:00:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:00:25,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2021-01-07 05:00:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:25,653 INFO L225 Difference]: With dead ends: 146 [2021-01-07 05:00:25,653 INFO L226 Difference]: Without dead ends: 146 [2021-01-07 05:00:25,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:00:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-01-07 05:00:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2021-01-07 05:00:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2021-01-07 05:00:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2021-01-07 05:00:25,658 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2021-01-07 05:00:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:25,659 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2021-01-07 05:00:25,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:00:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2021-01-07 05:00:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:00:25,659 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:25,659 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:25,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:25,873 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1001387738, now seen corresponding path program 2 times [2021-01-07 05:00:25,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:25,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648039944] [2021-01-07 05:00:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:26,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648039944] [2021-01-07 05:00:26,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112509097] [2021-01-07 05:00:26,171 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 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:00:26,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:00:26,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:26,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-07 05:00:26,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:26,371 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 14 treesize of output 10 [2021-01-07 05:00:26,372 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:26,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:26,383 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:00:26,384 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:00:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:26,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:26,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-01-07 05:00:26,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839316729] [2021-01-07 05:00:26,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:00:26,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:00:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:00:26,713 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 23 states. [2021-01-07 05:00:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:27,510 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2021-01-07 05:00:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:00:27,511 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2021-01-07 05:00:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:27,512 INFO L225 Difference]: With dead ends: 183 [2021-01-07 05:00:27,512 INFO L226 Difference]: Without dead ends: 183 [2021-01-07 05:00:27,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:00:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-01-07 05:00:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2021-01-07 05:00:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-07 05:00:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2021-01-07 05:00:27,518 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 36 [2021-01-07 05:00:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:27,518 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2021-01-07 05:00:27,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:00:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2021-01-07 05:00:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:00:27,519 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:27,519 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, 1, 1] [2021-01-07 05:00:27,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 05:00:27,733 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1892678105, now seen corresponding path program 2 times [2021-01-07 05:00:27,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:27,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334152015] [2021-01-07 05:00:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:28,034 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:00:28,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334152015] [2021-01-07 05:00:28,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483532639] [2021-01-07 05:00:28,035 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 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:00:28,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:00:28,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:28,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 32 conjunts are in the unsatisfiable core [2021-01-07 05:00:28,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:28,138 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:00:28,140 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:28,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:28,145 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:28,145 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:00:28,247 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 14 treesize of output 10 [2021-01-07 05:00:28,247 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:28,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:28,262 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:00:28,262 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-01-07 05:00:28,315 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-01-07 05:00:28,320 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:28,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:28,341 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:00:28,341 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2021-01-07 05:00:28,688 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:28,689 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 1 case distinctions, treesize of input 28 treesize of output 21 [2021-01-07 05:00:28,691 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:00:28,706 INFO L625 ElimStorePlain]: treesize reduction 5, result has 73.7 percent of original size [2021-01-07 05:00:28,709 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:28,709 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2021-01-07 05:00:28,744 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:00:28,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:28,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-01-07 05:00:28,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986356098] [2021-01-07 05:00:28,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:00:28,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:28,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:00:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:00:28,746 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 19 states. [2021-01-07 05:00:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:29,563 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2021-01-07 05:00:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:00:29,564 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2021-01-07 05:00:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:29,565 INFO L225 Difference]: With dead ends: 263 [2021-01-07 05:00:29,565 INFO L226 Difference]: Without dead ends: 217 [2021-01-07 05:00:29,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:00:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-07 05:00:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2021-01-07 05:00:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-07 05:00:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2021-01-07 05:00:29,572 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 38 [2021-01-07 05:00:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:29,572 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2021-01-07 05:00:29,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:00:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2021-01-07 05:00:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:00:29,573 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:29,573 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:29,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:29,788 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash -304963965, now seen corresponding path program 3 times [2021-01-07 05:00:29,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:29,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210050035] [2021-01-07 05:00:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:29,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210050035] [2021-01-07 05:00:29,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739175160] [2021-01-07 05:00:29,942 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 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:00:30,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:00:30,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:30,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-07 05:00:30,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:30,043 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:30,044 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:00:30,046 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:30,063 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:00:30,065 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:30,066 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:00:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:30,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:30,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-01-07 05:00:30,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839746168] [2021-01-07 05:00:30,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:00:30,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:00:30,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:00:30,291 INFO L87 Difference]: Start difference. First operand 208 states and 243 transitions. Second operand 20 states. [2021-01-07 05:00:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:30,840 INFO L93 Difference]: Finished difference Result 267 states and 303 transitions. [2021-01-07 05:00:30,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:00:30,841 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2021-01-07 05:00:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:30,845 INFO L225 Difference]: With dead ends: 267 [2021-01-07 05:00:30,845 INFO L226 Difference]: Without dead ends: 265 [2021-01-07 05:00:30,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:00:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-01-07 05:00:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 226. [2021-01-07 05:00:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2021-01-07 05:00:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2021-01-07 05:00:30,856 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 40 [2021-01-07 05:00:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:30,856 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2021-01-07 05:00:30,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:00:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2021-01-07 05:00:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 05:00:30,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:30,857 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, 1, 1] [2021-01-07 05:00:31,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 05:00:31,072 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2034497590, now seen corresponding path program 3 times [2021-01-07 05:00:31,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:31,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219462322] [2021-01-07 05:00:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:31,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219462322] [2021-01-07 05:00:31,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561018340] [2021-01-07 05:00:31,204 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 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:00:31,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:00:31,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:31,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 05:00:31,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:31,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:31,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2021-01-07 05:00:31,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636597863] [2021-01-07 05:00:31,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:00:31,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:00:31,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:00:31,461 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand 17 states. [2021-01-07 05:00:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:31,852 INFO L93 Difference]: Finished difference Result 353 states and 406 transitions. [2021-01-07 05:00:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:00:31,853 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2021-01-07 05:00:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:31,855 INFO L225 Difference]: With dead ends: 353 [2021-01-07 05:00:31,856 INFO L226 Difference]: Without dead ends: 353 [2021-01-07 05:00:31,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:00:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-01-07 05:00:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 288. [2021-01-07 05:00:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-07 05:00:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 340 transitions. [2021-01-07 05:00:31,864 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 340 transitions. Word has length 42 [2021-01-07 05:00:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:31,865 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 340 transitions. [2021-01-07 05:00:31,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:00:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 340 transitions. [2021-01-07 05:00:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:00:31,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:31,866 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:32,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-07 05:00:32,081 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:32,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:32,082 INFO L82 PathProgramCache]: Analyzing trace with hash 371510231, now seen corresponding path program 4 times [2021-01-07 05:00:32,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:32,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092553987] [2021-01-07 05:00:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:32,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092553987] [2021-01-07 05:00:32,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644972855] [2021-01-07 05:00:32,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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:00:32,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:00:32,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:32,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-07 05:00:32,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:32,915 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:32,916 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:00:32,918 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:32,954 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:00:32,957 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:32,957 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:00:33,127 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 15 treesize of output 11 [2021-01-07 05:00:33,128 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:33,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:33,133 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:33,133 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-01-07 05:00:33,457 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 18 [2021-01-07 05:00:33,460 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:00:33,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:33,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:00:33,476 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:33,477 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-01-07 05:00:33,478 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:33,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:33,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:33,490 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2021-01-07 05:00:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:33,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:33,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2021-01-07 05:00:33,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096047499] [2021-01-07 05:00:33,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:00:33,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:00:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:00:33,506 INFO L87 Difference]: Start difference. First operand 288 states and 340 transitions. Second operand 30 states. [2021-01-07 05:00:34,037 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2021-01-07 05:00:34,251 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2021-01-07 05:00:35,519 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-01-07 05:00:36,538 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2021-01-07 05:00:37,193 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2021-01-07 05:00:37,350 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-01-07 05:00:37,618 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2021-01-07 05:00:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:38,429 INFO L93 Difference]: Finished difference Result 471 states and 529 transitions. [2021-01-07 05:00:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-01-07 05:00:38,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2021-01-07 05:00:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:38,433 INFO L225 Difference]: With dead ends: 471 [2021-01-07 05:00:38,433 INFO L226 Difference]: Without dead ends: 449 [2021-01-07 05:00:38,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=839, Invalid=4563, Unknown=0, NotChecked=0, Total=5402 [2021-01-07 05:00:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-01-07 05:00:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 371. [2021-01-07 05:00:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2021-01-07 05:00:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 438 transitions. [2021-01-07 05:00:38,445 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 438 transitions. Word has length 46 [2021-01-07 05:00:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:38,445 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 438 transitions. [2021-01-07 05:00:38,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:00:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 438 transitions. [2021-01-07 05:00:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 05:00:38,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:38,447 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:38,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 05:00:38,661 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:38,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:38,662 INFO L82 PathProgramCache]: Analyzing trace with hash -129625868, now seen corresponding path program 5 times [2021-01-07 05:00:38,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:38,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469925773] [2021-01-07 05:00:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:38,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469925773] [2021-01-07 05:00:38,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216814367] [2021-01-07 05:00:38,857 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_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:00:38,949 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-01-07 05:00:38,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:38,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-07 05:00:38,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:38,976 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:38,976 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:00:38,977 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:38,994 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:00:38,996 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:38,996 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:00:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:39,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:39,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2021-01-07 05:00:39,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257522817] [2021-01-07 05:00:39,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-07 05:00:39,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:39,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-07 05:00:39,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:00:39,364 INFO L87 Difference]: Start difference. First operand 371 states and 438 transitions. Second operand 24 states. [2021-01-07 05:00:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:40,530 INFO L93 Difference]: Finished difference Result 473 states and 541 transitions. [2021-01-07 05:00:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:00:40,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2021-01-07 05:00:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:40,534 INFO L225 Difference]: With dead ends: 473 [2021-01-07 05:00:40,535 INFO L226 Difference]: Without dead ends: 471 [2021-01-07 05:00:40,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:00:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-01-07 05:00:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 395. [2021-01-07 05:00:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2021-01-07 05:00:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 468 transitions. [2021-01-07 05:00:40,546 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 468 transitions. Word has length 50 [2021-01-07 05:00:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:40,547 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 468 transitions. [2021-01-07 05:00:40,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-07 05:00:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 468 transitions. [2021-01-07 05:00:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:00:40,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:40,548 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:40,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 05:00:40,763 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1388988596, now seen corresponding path program 4 times [2021-01-07 05:00:40,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:40,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264878269] [2021-01-07 05:00:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:40,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264878269] [2021-01-07 05:00:40,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022622639] [2021-01-07 05:00:40,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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:00:41,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:00:41,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:41,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2021-01-07 05:00:41,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:41,071 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_33|]} [2021-01-07 05:00:41,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:41,076 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-01-07 05:00:41,077 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:41,091 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:00:41,093 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:41,105 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,106 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-01-07 05:00:41,279 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 15 treesize of output 11 [2021-01-07 05:00:41,280 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:41,289 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-01-07 05:00:41,338 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2021-01-07 05:00:41,341 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:41,352 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:00:41,353 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2021-01-07 05:00:41,756 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2021-01-07 05:00:41,759 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:00:41,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:41,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:00:41,781 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 0 case distinctions, treesize of input 27 treesize of output 10 [2021-01-07 05:00:41,782 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:41,794 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:41,794 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:3 [2021-01-07 05:00:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:41,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:41,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-01-07 05:00:41,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164926820] [2021-01-07 05:00:41,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-07 05:00:41,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-07 05:00:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:00:41,825 INFO L87 Difference]: Start difference. First operand 395 states and 468 transitions. Second operand 22 states. [2021-01-07 05:00:44,565 WARN L197 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2021-01-07 05:00:45,383 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2021-01-07 05:00:47,750 WARN L197 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-01-07 05:00:47,889 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2021-01-07 05:00:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:48,026 INFO L93 Difference]: Finished difference Result 636 states and 740 transitions. [2021-01-07 05:00:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:00:48,027 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2021-01-07 05:00:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:48,030 INFO L225 Difference]: With dead ends: 636 [2021-01-07 05:00:48,030 INFO L226 Difference]: Without dead ends: 511 [2021-01-07 05:00:48,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2021-01-07 05:00:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-01-07 05:00:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 460. [2021-01-07 05:00:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2021-01-07 05:00:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 548 transitions. [2021-01-07 05:00:48,042 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 548 transitions. Word has length 53 [2021-01-07 05:00:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:48,042 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 548 transitions. [2021-01-07 05:00:48,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-07 05:00:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 548 transitions. [2021-01-07 05:00:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:00:48,043 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:48,044 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:48,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:00:48,258 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash 509273480, now seen corresponding path program 6 times [2021-01-07 05:00:48,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:48,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786637897] [2021-01-07 05:00:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:48,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786637897] [2021-01-07 05:00:48,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132389828] [2021-01-07 05:00:48,552 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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:00:48,657 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-01-07 05:00:48,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:48,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 38 conjunts are in the unsatisfiable core [2021-01-07 05:00:48,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:48,687 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:48,688 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:00:48,690 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:48,708 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:00:48,711 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:48,711 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:00:48,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-01-07 05:00:48,901 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:48,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:48,909 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:48,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-01-07 05:00:49,326 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:49,326 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-01-07 05:00:49,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:00:49,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:49,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:00:49,344 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:49,345 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2021-01-07 05:00:49,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:00:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:49,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:49,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2021-01-07 05:00:49,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373892394] [2021-01-07 05:00:49,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:00:49,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:00:49,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:00:49,632 INFO L87 Difference]: Start difference. First operand 460 states and 548 transitions. Second operand 33 states. [2021-01-07 05:00:50,950 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-01-07 05:00:51,955 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-01-07 05:00:52,150 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2021-01-07 05:00:52,819 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2021-01-07 05:00:53,038 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-01-07 05:00:53,604 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2021-01-07 05:00:53,835 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2021-01-07 05:00:54,015 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-01-07 05:00:54,237 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2021-01-07 05:00:54,917 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-01-07 05:00:55,546 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2021-01-07 05:00:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:56,108 INFO L93 Difference]: Finished difference Result 889 states and 1006 transitions. [2021-01-07 05:00:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-01-07 05:00:56,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 56 [2021-01-07 05:00:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:56,112 INFO L225 Difference]: With dead ends: 889 [2021-01-07 05:00:56,112 INFO L226 Difference]: Without dead ends: 807 [2021-01-07 05:00:56,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=936, Invalid=4176, Unknown=0, NotChecked=0, Total=5112 [2021-01-07 05:00:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-01-07 05:00:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 595. [2021-01-07 05:00:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2021-01-07 05:00:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 712 transitions. [2021-01-07 05:00:56,132 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 712 transitions. Word has length 56 [2021-01-07 05:00:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:56,132 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 712 transitions. [2021-01-07 05:00:56,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 05:00:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 712 transitions. [2021-01-07 05:00:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 05:00:56,134 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:56,134 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:56,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:56,346 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1575476041, now seen corresponding path program 5 times [2021-01-07 05:00:56,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:56,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453306116] [2021-01-07 05:00:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:56,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453306116] [2021-01-07 05:00:56,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501795428] [2021-01-07 05:00:56,515 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:56,602 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-01-07 05:00:56,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:56,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 05:00:56,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:56,618 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_34|]} [2021-01-07 05:00:56,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:56,623 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-01-07 05:00:56,624 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:56,636 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:56,642 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:00:56,644 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:56,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:56,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:56,659 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2021-01-07 05:00:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:56,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:56,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-01-07 05:00:56,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064229234] [2021-01-07 05:00:56,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:00:56,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:00:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:00:56,875 INFO L87 Difference]: Start difference. First operand 595 states and 712 transitions. Second operand 17 states. [2021-01-07 05:00:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:57,510 INFO L93 Difference]: Finished difference Result 892 states and 1049 transitions. [2021-01-07 05:00:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:00:57,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2021-01-07 05:00:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:57,515 INFO L225 Difference]: With dead ends: 892 [2021-01-07 05:00:57,515 INFO L226 Difference]: Without dead ends: 892 [2021-01-07 05:00:57,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:00:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-01-07 05:00:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 721. [2021-01-07 05:00:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2021-01-07 05:00:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 865 transitions. [2021-01-07 05:00:57,535 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 865 transitions. Word has length 57 [2021-01-07 05:00:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:57,536 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 865 transitions. [2021-01-07 05:00:57,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:00:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 865 transitions. [2021-01-07 05:00:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-07 05:00:57,537 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:57,538 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:57,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-07 05:00:57,752 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:00:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 265315897, now seen corresponding path program 7 times [2021-01-07 05:00:57,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:57,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003448228] [2021-01-07 05:00:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 17 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:58,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003448228] [2021-01-07 05:00:58,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889844286] [2021-01-07 05:00:58,081 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:58,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-07 05:00:58,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:58,378 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 14 treesize of output 10 [2021-01-07 05:00:58,381 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:58,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:58,390 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:00:58,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:00:58,610 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:00:58,611 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:58,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:58,614 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:58,614 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 05:00:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 17 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:58,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:58,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2021-01-07 05:00:58,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261174004] [2021-01-07 05:00:58,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-07 05:00:58,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:58,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-07 05:00:58,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:00:58,647 INFO L87 Difference]: Start difference. First operand 721 states and 865 transitions. Second operand 29 states. [2021-01-07 05:01:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:01:00,779 INFO L93 Difference]: Finished difference Result 1096 states and 1274 transitions. [2021-01-07 05:01:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-07 05:01:00,781 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2021-01-07 05:01:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:01:00,786 INFO L225 Difference]: With dead ends: 1096 [2021-01-07 05:01:00,786 INFO L226 Difference]: Without dead ends: 998 [2021-01-07 05:01:00,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=333, Invalid=2019, Unknown=0, NotChecked=0, Total=2352 [2021-01-07 05:01:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-01-07 05:01:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 879. [2021-01-07 05:01:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2021-01-07 05:01:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1058 transitions. [2021-01-07 05:01:00,814 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1058 transitions. Word has length 66 [2021-01-07 05:01:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:01:00,814 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1058 transitions. [2021-01-07 05:01:00,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-07 05:01:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1058 transitions. [2021-01-07 05:01:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-07 05:01:00,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:01:00,820 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:01:01,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:01,033 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:01:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:01:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2040073837, now seen corresponding path program 6 times [2021-01-07 05:01:01,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:01:01,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061300198] [2021-01-07 05:01:01,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:01:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:01:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 31 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:01:01,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061300198] [2021-01-07 05:01:01,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371906962] [2021-01-07 05:01:01,319 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:01,430 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-01-07 05:01:01,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:01:01,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 44 conjunts are in the unsatisfiable core [2021-01-07 05:01:01,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:01:01,443 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:01:01,444 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:01,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:01,450 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:01,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:01:01,631 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:01:01,632 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:01,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:01,641 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:01:01,641 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-01-07 05:01:01,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-01-07 05:01:01,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:01,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:01,709 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:01:01,709 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2021-01-07 05:01:02,266 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:02,267 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 1 case distinctions, treesize of input 28 treesize of output 21 [2021-01-07 05:01:02,269 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:01:02,286 INFO L625 ElimStorePlain]: treesize reduction 5, result has 73.7 percent of original size [2021-01-07 05:01:02,288 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:02,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2021-01-07 05:01:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 31 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:01:02,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:01:02,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2021-01-07 05:01:02,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25925766] [2021-01-07 05:01:02,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:01:02,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:01:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:01:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:01:02,336 INFO L87 Difference]: Start difference. First operand 879 states and 1058 transitions. Second operand 26 states. [2021-01-07 05:01:07,199 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:01:11,618 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:01:15,847 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:01:19,970 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2021-01-07 05:01:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:01:20,007 INFO L93 Difference]: Finished difference Result 1487 states and 1762 transitions. [2021-01-07 05:01:20,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:01:20,007 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2021-01-07 05:01:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:01:20,012 INFO L225 Difference]: With dead ends: 1487 [2021-01-07 05:01:20,012 INFO L226 Difference]: Without dead ends: 1109 [2021-01-07 05:01:20,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:01:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-01-07 05:01:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 958. [2021-01-07 05:01:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2021-01-07 05:01:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1154 transitions. [2021-01-07 05:01:20,043 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1154 transitions. Word has length 68 [2021-01-07 05:01:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:01:20,043 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 1154 transitions. [2021-01-07 05:01:20,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:01:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1154 transitions. [2021-01-07 05:01:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-07 05:01:20,045 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:01:20,045 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:01:20,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-01-07 05:01:20,246 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:01:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:01:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1055980246, now seen corresponding path program 8 times [2021-01-07 05:01:20,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:01:20,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494911255] [2021-01-07 05:01:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:01:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:01:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 15 proven. 95 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:01:20,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494911255] [2021-01-07 05:01:20,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757803239] [2021-01-07 05:01:20,548 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:20,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:01:20,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:01:20,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 05:01:20,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:01:20,676 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:20,677 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:01:20,678 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:20,698 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:01:20,700 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:20,701 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:01:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:01:21,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:01:21,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-01-07 05:01:21,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161543714] [2021-01-07 05:01:21,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:01:21,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:01:21,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:01:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:01:21,214 INFO L87 Difference]: Start difference. First operand 958 states and 1154 transitions. Second operand 31 states. [2021-01-07 05:01:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:01:22,649 INFO L93 Difference]: Finished difference Result 1222 states and 1421 transitions. [2021-01-07 05:01:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:01:22,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 70 [2021-01-07 05:01:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:01:22,656 INFO L225 Difference]: With dead ends: 1222 [2021-01-07 05:01:22,656 INFO L226 Difference]: Without dead ends: 1220 [2021-01-07 05:01:22,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:01:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-01-07 05:01:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1000. [2021-01-07 05:01:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2021-01-07 05:01:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1208 transitions. [2021-01-07 05:01:22,684 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1208 transitions. Word has length 70 [2021-01-07 05:01:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:01:22,684 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1208 transitions. [2021-01-07 05:01:22,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:01:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1208 transitions. [2021-01-07 05:01:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-07 05:01:22,686 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:01:22,686 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:01:22,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:22,901 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:01:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:01:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash 316354352, now seen corresponding path program 7 times [2021-01-07 05:01:22,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:01:22,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390370399] [2021-01-07 05:01:22,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:01:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:01:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 6 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:01:23,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390370399] [2021-01-07 05:01:23,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73009593] [2021-01-07 05:01:23,143 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:01:23,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-07 05:01:23,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:01:23,311 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:23,311 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:01:23,313 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:23,340 INFO L625 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2021-01-07 05:01:23,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,342 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:01:23,343 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:21 [2021-01-07 05:01:23,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:23,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:01:24,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:01:24,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2021-01-07 05:01:24,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018621098] [2021-01-07 05:01:24,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:01:24,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:01:24,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:01:24,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:01:24,561 INFO L87 Difference]: Start difference. First operand 1000 states and 1208 transitions. Second operand 26 states. [2021-01-07 05:01:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:01:27,478 INFO L93 Difference]: Finished difference Result 1560 states and 1843 transitions. [2021-01-07 05:01:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:01:27,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2021-01-07 05:01:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:01:27,484 INFO L225 Difference]: With dead ends: 1560 [2021-01-07 05:01:27,485 INFO L226 Difference]: Without dead ends: 1560 [2021-01-07 05:01:27,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:01:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-01-07 05:01:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1167. [2021-01-07 05:01:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2021-01-07 05:01:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1412 transitions. [2021-01-07 05:01:27,524 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1412 transitions. Word has length 72 [2021-01-07 05:01:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:01:27,524 INFO L481 AbstractCegarLoop]: Abstraction has 1167 states and 1412 transitions. [2021-01-07 05:01:27,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:01:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1412 transitions. [2021-01-07 05:01:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-07 05:01:27,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:01:27,527 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:01:27,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-07 05:01:27,741 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:01:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:01:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2092129770, now seen corresponding path program 9 times [2021-01-07 05:01:27,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:01:27,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842888833] [2021-01-07 05:01:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:01:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:01:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:01:28,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842888833] [2021-01-07 05:01:28,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450034642] [2021-01-07 05:01:28,192 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:28,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-01-07 05:01:28,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:01:28,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-07 05:01:28,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:01:28,722 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 14 treesize of output 10 [2021-01-07 05:01:28,724 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:28,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:28,734 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:01:28,734 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:01:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:01:29,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:01:29,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 34 [2021-01-07 05:01:29,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911985467] [2021-01-07 05:01:29,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-07 05:01:29,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:01:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-07 05:01:29,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:01:29,135 INFO L87 Difference]: Start difference. First operand 1167 states and 1412 transitions. Second operand 34 states. [2021-01-07 05:01:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:01:32,710 INFO L93 Difference]: Finished difference Result 1765 states and 2073 transitions. [2021-01-07 05:01:32,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-07 05:01:32,711 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2021-01-07 05:01:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:01:32,717 INFO L225 Difference]: With dead ends: 1765 [2021-01-07 05:01:32,717 INFO L226 Difference]: Without dead ends: 1573 [2021-01-07 05:01:32,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=392, Invalid=2800, Unknown=0, NotChecked=0, Total=3192 [2021-01-07 05:01:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2021-01-07 05:01:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1394. [2021-01-07 05:01:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2021-01-07 05:01:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1692 transitions. [2021-01-07 05:01:32,747 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1692 transitions. Word has length 76 [2021-01-07 05:01:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:01:32,747 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1692 transitions. [2021-01-07 05:01:32,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-07 05:01:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1692 transitions. [2021-01-07 05:01:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-07 05:01:32,750 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:01:32,750 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:01:32,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-01-07 05:01:32,964 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:01:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:01:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash -882077113, now seen corresponding path program 10 times [2021-01-07 05:01:32,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:01:32,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80499691] [2021-01-07 05:01:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:01:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:01:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 134 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:01:33,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80499691] [2021-01-07 05:01:33,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570750526] [2021-01-07 05:01:33,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:33,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:01:33,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:01:33,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-07 05:01:33,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:01:33,541 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:33,542 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:01:33,543 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:33,563 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:01:33,565 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:33,565 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:01:33,686 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 16 treesize of output 12 [2021-01-07 05:01:33,687 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:33,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:33,696 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:33,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-01-07 05:01:34,150 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:34,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-01-07 05:01:34,152 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:01:34,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:34,166 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:34,166 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2021-01-07 05:01:34,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 50 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:01:34,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:01:34,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 33 [2021-01-07 05:01:34,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508169544] [2021-01-07 05:01:34,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-07 05:01:34,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:01:34,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-07 05:01:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:01:34,469 INFO L87 Difference]: Start difference. First operand 1394 states and 1692 transitions. Second operand 34 states. [2021-01-07 05:01:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:01:39,305 INFO L93 Difference]: Finished difference Result 1898 states and 2199 transitions. [2021-01-07 05:01:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:01:39,306 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 80 [2021-01-07 05:01:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:01:39,312 INFO L225 Difference]: With dead ends: 1898 [2021-01-07 05:01:39,312 INFO L226 Difference]: Without dead ends: 1896 [2021-01-07 05:01:39,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=539, Invalid=2653, Unknown=0, NotChecked=0, Total=3192 [2021-01-07 05:01:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2021-01-07 05:01:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1442. [2021-01-07 05:01:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2021-01-07 05:01:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1754 transitions. [2021-01-07 05:01:39,346 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1754 transitions. Word has length 80 [2021-01-07 05:01:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:01:39,346 INFO L481 AbstractCegarLoop]: Abstraction has 1442 states and 1754 transitions. [2021-01-07 05:01:39,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-07 05:01:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1754 transitions. [2021-01-07 05:01:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 05:01:39,349 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:01:39,349 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:01:39,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-01-07 05:01:39,565 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:01:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:01:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1590636166, now seen corresponding path program 8 times [2021-01-07 05:01:39,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:01:39,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880806539] [2021-01-07 05:01:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:01:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:01:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:01:39,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880806539] [2021-01-07 05:01:39,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743001241] [2021-01-07 05:01:39,907 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:01:40,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:01:40,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:01:40,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 50 conjunts are in the unsatisfiable core [2021-01-07 05:01:40,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:01:40,029 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:01:40,031 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:40,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:40,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:40,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:01:40,300 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 14 treesize of output 10 [2021-01-07 05:01:40,301 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:40,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:40,314 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:01:40,314 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-01-07 05:01:40,382 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-01-07 05:01:40,384 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:40,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:40,398 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:01:40,398 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2021-01-07 05:01:41,163 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:41,163 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 1 case distinctions, treesize of input 28 treesize of output 21 [2021-01-07 05:01:41,165 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:01:41,182 INFO L625 ElimStorePlain]: treesize reduction 5, result has 73.7 percent of original size [2021-01-07 05:01:41,184 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:01:41,184 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2021-01-07 05:01:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:01:41,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:01:41,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-01-07 05:01:41,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813913029] [2021-01-07 05:01:41,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:01:41,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:01:41,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:01:41,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:01:41,238 INFO L87 Difference]: Start difference. First operand 1442 states and 1754 transitions. Second operand 30 states. [2021-01-07 05:01:46,359 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:01:50,833 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:01:55,113 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:01:59,335 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:02:03,470 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2021-01-07 05:02:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:03,513 INFO L93 Difference]: Finished difference Result 2562 states and 3078 transitions. [2021-01-07 05:02:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:02:03,514 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 83 [2021-01-07 05:02:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:03,520 INFO L225 Difference]: With dead ends: 2562 [2021-01-07 05:02:03,520 INFO L226 Difference]: Without dead ends: 1900 [2021-01-07 05:02:03,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:02:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2021-01-07 05:02:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1537. [2021-01-07 05:02:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1537 states. [2021-01-07 05:02:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1870 transitions. [2021-01-07 05:02:03,567 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1870 transitions. Word has length 83 [2021-01-07 05:02:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:03,567 INFO L481 AbstractCegarLoop]: Abstraction has 1537 states and 1870 transitions. [2021-01-07 05:02:03,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:02:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1870 transitions. [2021-01-07 05:02:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-07 05:02:03,571 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:03,571 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:03,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-01-07 05:02:03,786 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:02:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1484661605, now seen corresponding path program 11 times [2021-01-07 05:02:03,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:03,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536003205] [2021-01-07 05:02:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 25 proven. 174 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:04,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536003205] [2021-01-07 05:02:04,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083148906] [2021-01-07 05:02:04,318 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:04,442 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-01-07 05:02:04,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:04,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 58 conjunts are in the unsatisfiable core [2021-01-07 05:02:04,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:04,808 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:02:04,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:04,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:04,818 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:02:04,818 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:02:05,188 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:02:05,190 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:05,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:05,193 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:05,193 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 05:02:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 25 proven. 174 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:05,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:05,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 35 [2021-01-07 05:02:05,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978249817] [2021-01-07 05:02:05,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-01-07 05:02:05,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-01-07 05:02:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:02:05,224 INFO L87 Difference]: Start difference. First operand 1537 states and 1870 transitions. Second operand 35 states. [2021-01-07 05:02:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:09,316 INFO L93 Difference]: Finished difference Result 2323 states and 2744 transitions. [2021-01-07 05:02:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-07 05:02:09,317 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 86 [2021-01-07 05:02:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:09,325 INFO L225 Difference]: With dead ends: 2323 [2021-01-07 05:02:09,325 INFO L226 Difference]: Without dead ends: 2013 [2021-01-07 05:02:09,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=429, Invalid=3231, Unknown=0, NotChecked=0, Total=3660 [2021-01-07 05:02:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2021-01-07 05:02:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1798. [2021-01-07 05:02:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2021-01-07 05:02:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2194 transitions. [2021-01-07 05:02:09,359 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2194 transitions. Word has length 86 [2021-01-07 05:02:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:09,359 INFO L481 AbstractCegarLoop]: Abstraction has 1798 states and 2194 transitions. [2021-01-07 05:02:09,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-01-07 05:02:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2194 transitions. [2021-01-07 05:02:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-07 05:02:09,362 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:09,363 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:09,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-07 05:02:09,578 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:02:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 915408445, now seen corresponding path program 9 times [2021-01-07 05:02:09,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:09,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465492087] [2021-01-07 05:02:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 15 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:09,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465492087] [2021-01-07 05:02:09,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217647272] [2021-01-07 05:02:09,911 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:10,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-01-07 05:02:10,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:10,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjunts are in the unsatisfiable core [2021-01-07 05:02:10,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 28 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:10,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:10,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2021-01-07 05:02:10,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057200553] [2021-01-07 05:02:10,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-07 05:02:10,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-07 05:02:10,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:02:10,624 INFO L87 Difference]: Start difference. First operand 1798 states and 2194 transitions. Second operand 29 states. [2021-01-07 05:02:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:11,594 INFO L93 Difference]: Finished difference Result 2662 states and 3219 transitions. [2021-01-07 05:02:11,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:02:11,595 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2021-01-07 05:02:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:11,606 INFO L225 Difference]: With dead ends: 2662 [2021-01-07 05:02:11,606 INFO L226 Difference]: Without dead ends: 2662 [2021-01-07 05:02:11,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2021-01-07 05:02:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2021-01-07 05:02:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2059. [2021-01-07 05:02:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2021-01-07 05:02:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2516 transitions. [2021-01-07 05:02:11,645 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2516 transitions. Word has length 87 [2021-01-07 05:02:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:11,646 INFO L481 AbstractCegarLoop]: Abstraction has 2059 states and 2516 transitions. [2021-01-07 05:02:11,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-07 05:02:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2516 transitions. [2021-01-07 05:02:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-07 05:02:11,649 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:11,649 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:11,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:11,862 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:02:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash 777978040, now seen corresponding path program 12 times [2021-01-07 05:02:11,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:11,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253380986] [2021-01-07 05:02:11,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 45 proven. 179 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:12,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253380986] [2021-01-07 05:02:12,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717160446] [2021-01-07 05:02:12,356 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:12,558 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-01-07 05:02:12,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:12,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-07 05:02:12,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:12,588 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:12,589 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:02:12,590 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:12,611 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:02:12,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:12,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:02:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 66 proven. 158 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:13,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:13,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2021-01-07 05:02:13,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057928619] [2021-01-07 05:02:13,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-01-07 05:02:13,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-01-07 05:02:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:02:13,502 INFO L87 Difference]: Start difference. First operand 2059 states and 2516 transitions. Second operand 40 states. [2021-01-07 05:02:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:16,362 INFO L93 Difference]: Finished difference Result 2557 states and 3019 transitions. [2021-01-07 05:02:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:02:16,363 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2021-01-07 05:02:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:16,375 INFO L225 Difference]: With dead ends: 2557 [2021-01-07 05:02:16,375 INFO L226 Difference]: Without dead ends: 2555 [2021-01-07 05:02:16,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=484, Invalid=1966, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:02:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2021-01-07 05:02:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2119. [2021-01-07 05:02:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2119 states. [2021-01-07 05:02:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 2594 transitions. [2021-01-07 05:02:16,420 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 2594 transitions. Word has length 90 [2021-01-07 05:02:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:16,420 INFO L481 AbstractCegarLoop]: Abstraction has 2119 states and 2594 transitions. [2021-01-07 05:02:16,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2021-01-07 05:02:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2594 transitions. [2021-01-07 05:02:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-07 05:02:16,424 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:16,424 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:16,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-01-07 05:02:16,641 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:02:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash -737545652, now seen corresponding path program 13 times [2021-01-07 05:02:16,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:16,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499221351] [2021-01-07 05:02:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 29 proven. 238 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:17,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499221351] [2021-01-07 05:02:17,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422018591] [2021-01-07 05:02:17,221 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:17,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 64 conjunts are in the unsatisfiable core [2021-01-07 05:02:17,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:17,755 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 14 treesize of output 10 [2021-01-07 05:02:17,756 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:17,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:17,766 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:02:17,767 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:02:18,136 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:02:18,138 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:18,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:18,141 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:18,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 05:02:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 29 proven. 238 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:18,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:18,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 38 [2021-01-07 05:02:18,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381431840] [2021-01-07 05:02:18,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-07 05:02:18,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:18,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-07 05:02:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:02:18,174 INFO L87 Difference]: Start difference. First operand 2119 states and 2594 transitions. Second operand 38 states. [2021-01-07 05:02:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:23,451 INFO L93 Difference]: Finished difference Result 3105 states and 3696 transitions. [2021-01-07 05:02:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-01-07 05:02:23,451 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 96 [2021-01-07 05:02:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:23,460 INFO L225 Difference]: With dead ends: 3105 [2021-01-07 05:02:23,460 INFO L226 Difference]: Without dead ends: 2753 [2021-01-07 05:02:23,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=477, Invalid=3945, Unknown=0, NotChecked=0, Total=4422 [2021-01-07 05:02:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2021-01-07 05:02:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2463. [2021-01-07 05:02:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2021-01-07 05:02:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3025 transitions. [2021-01-07 05:02:23,494 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3025 transitions. Word has length 96 [2021-01-07 05:02:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:23,494 INFO L481 AbstractCegarLoop]: Abstraction has 2463 states and 3025 transitions. [2021-01-07 05:02:23,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-07 05:02:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3025 transitions. [2021-01-07 05:02:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-07 05:02:23,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:23,498 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:23,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:23,712 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:02:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2061828173, now seen corresponding path program 10 times [2021-01-07 05:02:23,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:23,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637141275] [2021-01-07 05:02:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 51 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:24,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637141275] [2021-01-07 05:02:24,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917344874] [2021-01-07 05:02:24,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:24,367 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:02:24,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:24,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 48 conjunts are in the unsatisfiable core [2021-01-07 05:02:24,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:24,381 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_35|], 1=[|v_#valid_37|]} [2021-01-07 05:02:24,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:02:24,386 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-01-07 05:02:24,387 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:24,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:24,403 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:02:24,405 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:24,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:24,416 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:24,416 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-01-07 05:02:24,836 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 16 treesize of output 12 [2021-01-07 05:02:24,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:24,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:24,849 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:24,850 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-01-07 05:02:24,925 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2021-01-07 05:02:24,927 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:24,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:24,943 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:02:24,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2021-01-07 05:02:25,947 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2021-01-07 05:02:25,950 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:02:25,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:25,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:02:25,984 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 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-07 05:02:25,986 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:25,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:26,003 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:26,003 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:56, output treesize:3 [2021-01-07 05:02:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 166 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:26,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:26,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2021-01-07 05:02:26,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172207350] [2021-01-07 05:02:26,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:02:26,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:02:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:02:26,111 INFO L87 Difference]: Start difference. First operand 2463 states and 3025 transitions. Second operand 33 states. [2021-01-07 05:02:30,104 WARN L197 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-01-07 05:02:34,592 WARN L197 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-01-07 05:02:35,178 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-01-07 05:02:35,762 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-01-07 05:02:40,057 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-01-07 05:02:40,642 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-01-07 05:02:41,278 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-01-07 05:02:41,639 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:02:46,061 WARN L197 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-01-07 05:02:46,522 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:02:46,995 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:02:55,401 WARN L197 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-01-07 05:02:55,731 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:02:56,105 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:03:00,605 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-01-07 05:03:04,853 WARN L197 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2021-01-07 05:03:05,199 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:03:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:06,624 INFO L93 Difference]: Finished difference Result 4575 states and 5554 transitions. [2021-01-07 05:03:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-01-07 05:03:06,626 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2021-01-07 05:03:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:06,640 INFO L225 Difference]: With dead ends: 4575 [2021-01-07 05:03:06,640 INFO L226 Difference]: Without dead ends: 3247 [2021-01-07 05:03:06,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=584, Invalid=4528, Unknown=0, NotChecked=0, Total=5112 [2021-01-07 05:03:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-01-07 05:03:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2572. [2021-01-07 05:03:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2572 states. [2021-01-07 05:03:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3157 transitions. [2021-01-07 05:03:06,676 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3157 transitions. Word has length 98 [2021-01-07 05:03:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:06,676 INFO L481 AbstractCegarLoop]: Abstraction has 2572 states and 3157 transitions. [2021-01-07 05:03:06,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 05:03:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3157 transitions. [2021-01-07 05:03:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-07 05:03:06,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:06,680 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:06,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-01-07 05:03:06,894 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:06,895 INFO L82 PathProgramCache]: Analyzing trace with hash 833771049, now seen corresponding path program 14 times [2021-01-07 05:03:06,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:06,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970267191] [2021-01-07 05:03:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 66 proven. 230 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:07,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970267191] [2021-01-07 05:03:07,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826622681] [2021-01-07 05:03:07,532 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:07,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:03:07,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:07,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 57 conjunts are in the unsatisfiable core [2021-01-07 05:03:07,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:07,684 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:07,685 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:07,688 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:07,715 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:03:07,717 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:07,718 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:03:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 91 proven. 205 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:08,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:08,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2021-01-07 05:03:08,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75511316] [2021-01-07 05:03:08,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-01-07 05:03:08,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:08,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-01-07 05:03:08,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1598, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:03:08,830 INFO L87 Difference]: Start difference. First operand 2572 states and 3157 transitions. Second operand 43 states. [2021-01-07 05:03:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:12,616 INFO L93 Difference]: Finished difference Result 3185 states and 3775 transitions. [2021-01-07 05:03:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:03:12,617 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 100 [2021-01-07 05:03:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:12,626 INFO L225 Difference]: With dead ends: 3185 [2021-01-07 05:03:12,626 INFO L226 Difference]: Without dead ends: 3183 [2021-01-07 05:03:12,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=507, Invalid=2355, Unknown=0, NotChecked=0, Total=2862 [2021-01-07 05:03:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2021-01-07 05:03:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 2638. [2021-01-07 05:03:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2021-01-07 05:03:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 3243 transitions. [2021-01-07 05:03:12,690 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 3243 transitions. Word has length 100 [2021-01-07 05:03:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:12,691 INFO L481 AbstractCegarLoop]: Abstraction has 2638 states and 3243 transitions. [2021-01-07 05:03:12,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2021-01-07 05:03:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3243 transitions. [2021-01-07 05:03:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-07 05:03:12,695 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:12,695 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:12,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:12,909 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash 248728874, now seen corresponding path program 11 times [2021-01-07 05:03:12,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:12,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994509054] [2021-01-07 05:03:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 28 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:13,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994509054] [2021-01-07 05:03:13,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681994249] [2021-01-07 05:03:13,305 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:13,443 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-01-07 05:03:13,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:13,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-07 05:03:13,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 45 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:13,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:13,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2021-01-07 05:03:13,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058516013] [2021-01-07 05:03:13,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:03:13,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:03:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:03:13,985 INFO L87 Difference]: Start difference. First operand 2638 states and 3243 transitions. Second operand 26 states. [2021-01-07 05:03:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:15,624 INFO L93 Difference]: Finished difference Result 3983 states and 4864 transitions. [2021-01-07 05:03:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:03:15,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2021-01-07 05:03:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:15,634 INFO L225 Difference]: With dead ends: 3983 [2021-01-07 05:03:15,634 INFO L226 Difference]: Without dead ends: 3983 [2021-01-07 05:03:15,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:03:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2021-01-07 05:03:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 2964. [2021-01-07 05:03:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2964 states. [2021-01-07 05:03:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 3648 transitions. [2021-01-07 05:03:15,703 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 3648 transitions. Word has length 102 [2021-01-07 05:03:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:15,704 INFO L481 AbstractCegarLoop]: Abstraction has 2964 states and 3648 transitions. [2021-01-07 05:03:15,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:03:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3648 transitions. [2021-01-07 05:03:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 05:03:15,708 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:15,708 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:15,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-01-07 05:03:15,922 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1737904387, now seen corresponding path program 15 times [2021-01-07 05:03:15,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:15,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014100374] [2021-01-07 05:03:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 33 proven. 312 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:16,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014100374] [2021-01-07 05:03:16,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75564757] [2021-01-07 05:03:16,626 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:16,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-01-07 05:03:16,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:16,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 72 conjunts are in the unsatisfiable core [2021-01-07 05:03:16,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:17,445 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 14 treesize of output 10 [2021-01-07 05:03:17,446 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:17,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:17,456 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:03:17,456 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:03:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 33 proven. 312 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:18,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:18,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 43 [2021-01-07 05:03:18,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140628393] [2021-01-07 05:03:18,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-01-07 05:03:18,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-01-07 05:03:18,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1690, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:03:18,042 INFO L87 Difference]: Start difference. First operand 2964 states and 3648 transitions. Second operand 43 states. [2021-01-07 05:03:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:25,428 INFO L93 Difference]: Finished difference Result 4293 states and 5142 transitions. [2021-01-07 05:03:25,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-01-07 05:03:25,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 106 [2021-01-07 05:03:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:25,436 INFO L225 Difference]: With dead ends: 4293 [2021-01-07 05:03:25,437 INFO L226 Difference]: Without dead ends: 3787 [2021-01-07 05:03:25,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=536, Invalid=5014, Unknown=0, NotChecked=0, Total=5550 [2021-01-07 05:03:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2021-01-07 05:03:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3407. [2021-01-07 05:03:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3407 states. [2021-01-07 05:03:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 4206 transitions. [2021-01-07 05:03:25,495 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 4206 transitions. Word has length 106 [2021-01-07 05:03:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:25,496 INFO L481 AbstractCegarLoop]: Abstraction has 3407 states and 4206 transitions. [2021-01-07 05:03:25,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2021-01-07 05:03:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 4206 transitions. [2021-01-07 05:03:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-07 05:03:25,502 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:25,502 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:25,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:25,717 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash -23027046, now seen corresponding path program 16 times [2021-01-07 05:03:25,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:25,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969851509] [2021-01-07 05:03:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 91 proven. 287 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:26,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969851509] [2021-01-07 05:03:26,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025521014] [2021-01-07 05:03:26,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:26,613 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:03:26,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:26,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 69 conjunts are in the unsatisfiable core [2021-01-07 05:03:26,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:26,646 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:26,647 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:26,652 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:26,677 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:03:26,679 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:26,680 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:03:26,848 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 16 treesize of output 12 [2021-01-07 05:03:26,849 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:26,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:26,858 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:26,858 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-01-07 05:03:27,893 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:27,893 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-01-07 05:03:27,895 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:03:27,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:27,917 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:27,917 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2021-01-07 05:03:28,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 128 proven. 250 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:28,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:28,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 42 [2021-01-07 05:03:28,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300263596] [2021-01-07 05:03:28,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-01-07 05:03:28,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-01-07 05:03:28,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1667, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:03:28,421 INFO L87 Difference]: Start difference. First operand 3407 states and 4206 transitions. Second operand 43 states. [2021-01-07 05:03:33,124 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-01-07 05:03:34,520 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-01-07 05:03:35,049 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-01-07 05:03:35,589 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-01-07 05:03:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:38,367 INFO L93 Difference]: Finished difference Result 4491 states and 5295 transitions. [2021-01-07 05:03:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-01-07 05:03:38,368 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 110 [2021-01-07 05:03:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:38,377 INFO L225 Difference]: With dead ends: 4491 [2021-01-07 05:03:38,377 INFO L226 Difference]: Without dead ends: 4489 [2021-01-07 05:03:38,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=794, Invalid=4318, Unknown=0, NotChecked=0, Total=5112 [2021-01-07 05:03:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2021-01-07 05:03:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 3479. [2021-01-07 05:03:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3479 states. [2021-01-07 05:03:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 4300 transitions. [2021-01-07 05:03:38,455 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 4300 transitions. Word has length 110 [2021-01-07 05:03:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:38,456 INFO L481 AbstractCegarLoop]: Abstraction has 3479 states and 4300 transitions. [2021-01-07 05:03:38,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2021-01-07 05:03:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 4300 transitions. [2021-01-07 05:03:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-07 05:03:38,461 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:38,462 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:38,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-01-07 05:03:38,676 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1653599424, now seen corresponding path program 12 times [2021-01-07 05:03:38,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:38,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393248743] [2021-01-07 05:03:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 61 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:39,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393248743] [2021-01-07 05:03:39,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061440861] [2021-01-07 05:03:39,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:39,775 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-01-07 05:03:39,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:39,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 66 conjunts are in the unsatisfiable core [2021-01-07 05:03:39,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:39,797 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-07 05:03:39,799 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:39,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:39,808 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:39,808 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:03:40,361 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 14 treesize of output 10 [2021-01-07 05:03:40,362 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:40,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:40,376 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:03:40,376 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-01-07 05:03:40,475 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-01-07 05:03:40,479 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:40,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:40,505 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:03:40,505 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2021-01-07 05:03:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 61 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:42,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:42,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2021-01-07 05:03:42,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810298220] [2021-01-07 05:03:42,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:03:42,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:03:42,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1385, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:03:42,412 INFO L87 Difference]: Start difference. First operand 3479 states and 4300 transitions. Second operand 39 states. [2021-01-07 05:03:44,257 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2021-01-07 05:03:48,672 WARN L197 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:03:53,318 WARN L197 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:03:58,303 WARN L197 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:04:02,892 WARN L197 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:04:07,290 WARN L197 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:04:11,724 WARN L197 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-07 05:04:15,946 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2021-01-07 05:04:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:16,030 INFO L93 Difference]: Finished difference Result 6706 states and 8244 transitions. [2021-01-07 05:04:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:04:16,031 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 113 [2021-01-07 05:04:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:16,043 INFO L225 Difference]: With dead ends: 6706 [2021-01-07 05:04:16,044 INFO L226 Difference]: Without dead ends: 4763 [2021-01-07 05:04:16,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=246, Invalid=2304, Unknown=0, NotChecked=0, Total=2550 [2021-01-07 05:04:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2021-01-07 05:04:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 3604. [2021-01-07 05:04:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2021-01-07 05:04:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4452 transitions. [2021-01-07 05:04:16,112 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4452 transitions. Word has length 113 [2021-01-07 05:04:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:16,113 INFO L481 AbstractCegarLoop]: Abstraction has 3604 states and 4452 transitions. [2021-01-07 05:04:16,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:04:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4452 transitions. [2021-01-07 05:04:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-07 05:04:16,118 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:16,119 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:16,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:16,333 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash 772743854, now seen corresponding path program 17 times [2021-01-07 05:04:16,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:16,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860640431] [2021-01-07 05:04:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 37 proven. 396 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:04:17,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860640431] [2021-01-07 05:04:17,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681025029] [2021-01-07 05:04:17,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:17,578 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-01-07 05:04:17,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:17,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 76 conjunts are in the unsatisfiable core [2021-01-07 05:04:17,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:18,509 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 14 treesize of output 10 [2021-01-07 05:04:18,510 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:18,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:18,524 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:04:18,524 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:04:19,211 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:04:19,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:19,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:19,217 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:19,217 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 05:04:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 37 proven. 396 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:04:19,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:19,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 44 [2021-01-07 05:04:19,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21252312] [2021-01-07 05:04:19,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-07 05:04:19,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:19,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-07 05:04:19,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1776, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:04:19,250 INFO L87 Difference]: Start difference. First operand 3604 states and 4452 transitions. Second operand 44 states.