/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/cstrncat-alloca-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:00:16,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:00:16,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:00:16,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:00:16,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:00:16,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:00:16,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:00:16,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:00:16,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:00:16,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:00:16,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:00:16,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:00:16,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:00:16,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:00:16,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:00:16,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:00:16,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:00:16,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:00:16,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:00:16,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:00:16,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:00:16,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:00:16,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:00:16,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:00:16,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:00:16,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:00:16,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:00:16,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:00:16,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:00:16,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:00:16,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:00:16,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:00:16,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:00:16,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:00:16,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:00:16,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:00:16,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:00:16,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:00:16,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:00:16,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:00:16,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:00:16,151 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:16,178 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:00:16,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:00:16,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:00:16,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:00:16,180 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:00:16,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:00:16,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:00:16,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:00:16,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:00:16,181 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:00:16,181 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:00:16,182 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:00:16,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:00:16,182 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:00:16,182 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:00:16,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:00:16,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:00:16,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:00:16,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:00:16,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:00:16,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:00:16,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:00:16,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:00:16,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:00:16,184 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,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:00:16,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:00:16,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:00:16,593 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:00:16,594 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:00:16,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2021-01-07 05:00:16,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7264aa528/82de11e1feef482883a31bc221ce755e/FLAG832c2d478 [2021-01-07 05:00:17,306 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:00:17,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2021-01-07 05:00:17,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7264aa528/82de11e1feef482883a31bc221ce755e/FLAG832c2d478 [2021-01-07 05:00:17,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7264aa528/82de11e1feef482883a31bc221ce755e [2021-01-07 05:00:17,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:00:17,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:00:17,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:00:17,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:00:17,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:00:17,618 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,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eaeb697 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,619 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,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:00:17,664 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: IdentifierExpression[~s~0,] left hand side expression in assignment: address: IdentifierExpression[~s~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: lhs: VariableLHS[~n~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,BinaryExpression[ARITHMINUS,IdentifierExpression[~length1~0,],IdentifierExpression[~n~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:18,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:00:18,082 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: IdentifierExpression[~s~0,] left hand side expression in assignment: address: IdentifierExpression[~s~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: lhs: VariableLHS[~n~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,BinaryExpression[ARITHMINUS,IdentifierExpression[~length1~0,],IdentifierExpression[~n~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:18,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:00:18,232 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:00:18,233 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,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:00:18,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:00:18,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:00:18,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:00:18,243 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,260 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,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:00:18,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:00:18,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:00:18,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:00:18,296 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,296 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,300 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,301 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,308 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,313 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,315 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,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:00:18,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:00:18,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:00:18,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:00:18,320 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,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:00:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:00:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:00:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:00:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:00:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:00:18,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:00:18,997 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-07 05:00:18,998 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,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:00:19,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:00:19,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:00:19,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:00:19,007 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:19,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f56ffc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:00:19, skipping insertion in model container [2021-01-07 05:00:19,009 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:19,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f56ffc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:00:19, skipping insertion in model container [2021-01-07 05:00:19,011 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:19,013 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca-2.i [2021-01-07 05:00:19,024 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:00:19,031 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2021-01-07 05:00:19,052 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2021-01-07 05:00:19,088 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:00:19,089 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:00:19,089 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:00:19,089 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:00:19,089 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:00:19,089 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:00:19,090 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:00:19,090 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:00:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2021-01-07 05:00:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:00:19,121 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,123 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:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1805031117, now seen corresponding path program 1 times [2021-01-07 05:00:19,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693611138] [2021-01-07 05:00:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,378 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,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693611138] [2021-01-07 05:00:19,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:00:19,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242616162] [2021-01-07 05:00:19,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:00:19,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:00:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:00:19,410 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2021-01-07 05:00:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,501 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-01-07 05:00:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:00:19,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-07 05:00:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,512 INFO L225 Difference]: With dead ends: 54 [2021-01-07 05:00:19,512 INFO L226 Difference]: Without dead ends: 51 [2021-01-07 05:00:19,514 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,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-07 05:00:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-01-07 05:00:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-07 05:00:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2021-01-07 05:00:19,551 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 7 [2021-01-07 05:00:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,552 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2021-01-07 05:00:19,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:00:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2021-01-07 05:00:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:00:19,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:00:19,553 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,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash 121388915, now seen corresponding path program 1 times [2021-01-07 05:00:19,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445147290] [2021-01-07 05:00:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,622 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,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445147290] [2021-01-07 05:00:19,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:00:19,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894011472] [2021-01-07 05:00:19,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:19,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:19,631 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 5 states. [2021-01-07 05:00:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,756 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-01-07 05:00:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:19,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-01-07 05:00:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,760 INFO L225 Difference]: With dead ends: 54 [2021-01-07 05:00:19,760 INFO L226 Difference]: Without dead ends: 51 [2021-01-07 05:00:19,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-07 05:00:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-01-07 05:00:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-07 05:00:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2021-01-07 05:00:19,778 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 8 [2021-01-07 05:00:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,778 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2021-01-07 05:00:19,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2021-01-07 05:00:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:00:19,779 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:00:19,781 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,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash 178647217, now seen corresponding path program 1 times [2021-01-07 05:00:19,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503169979] [2021-01-07 05:00:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:19,846 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,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503169979] [2021-01-07 05:00:19,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:19,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:00:19,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049095660] [2021-01-07 05:00:19,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:00:19,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:19,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:00:19,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:00:19,850 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 3 states. [2021-01-07 05:00:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:19,889 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2021-01-07 05:00:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:00:19,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 05:00:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:19,891 INFO L225 Difference]: With dead ends: 49 [2021-01-07 05:00:19,891 INFO L226 Difference]: Without dead ends: 49 [2021-01-07 05:00:19,891 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,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-01-07 05:00:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-01-07 05:00:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2021-01-07 05:00:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-01-07 05:00:19,897 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 8 [2021-01-07 05:00:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:19,898 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-01-07 05:00:19,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:00:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2021-01-07 05:00:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:00:19,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:19,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:19,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:00:19,899 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,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash 178647218, now seen corresponding path program 1 times [2021-01-07 05:00:19,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:19,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771051061] [2021-01-07 05:00:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,041 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,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771051061] [2021-01-07 05:00:20,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:20,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577700643] [2021-01-07 05:00:20,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:20,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:20,044 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2021-01-07 05:00:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,181 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2021-01-07 05:00:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:20,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-01-07 05:00:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,183 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:00:20,183 INFO L226 Difference]: Without dead ends: 91 [2021-01-07 05:00:20,183 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,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-01-07 05:00:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 51. [2021-01-07 05:00:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-07 05:00:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2021-01-07 05:00:20,190 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 8 [2021-01-07 05:00:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,191 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2021-01-07 05:00:20,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2021-01-07 05:00:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:00:20,192 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:00:20,192 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:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash -118766615, now seen corresponding path program 1 times [2021-01-07 05:00:20,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237914817] [2021-01-07 05:00:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,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:20,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237914817] [2021-01-07 05:00:20,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:20,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661479279] [2021-01-07 05:00:20,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:20,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:20,319 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 5 states. [2021-01-07 05:00:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,383 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2021-01-07 05:00:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:20,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-07 05:00:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,385 INFO L225 Difference]: With dead ends: 50 [2021-01-07 05:00:20,385 INFO L226 Difference]: Without dead ends: 50 [2021-01-07 05:00:20,385 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,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-07 05:00:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-01-07 05:00:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:00:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-01-07 05:00:20,390 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 10 [2021-01-07 05:00:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,391 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-01-07 05:00:20,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-01-07 05:00:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:00:20,392 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:00:20,392 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:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash -118766563, now seen corresponding path program 1 times [2021-01-07 05:00:20,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946574140] [2021-01-07 05:00:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,431 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,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946574140] [2021-01-07 05:00:20,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:20,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262107747] [2021-01-07 05:00:20,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:20,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:20,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:20,434 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 4 states. [2021-01-07 05:00:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,455 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2021-01-07 05:00:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:20,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 05:00:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,457 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:00:20,457 INFO L226 Difference]: Without dead ends: 91 [2021-01-07 05:00:20,457 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:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-01-07 05:00:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2021-01-07 05:00:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-07 05:00:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2021-01-07 05:00:20,464 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 10 [2021-01-07 05:00:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,464 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2021-01-07 05:00:20,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2021-01-07 05:00:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:00:20,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:00:20,466 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:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1656240799, now seen corresponding path program 1 times [2021-01-07 05:00:20,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830559724] [2021-01-07 05:00:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,495 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,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830559724] [2021-01-07 05:00:20,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:00:20,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025202768] [2021-01-07 05:00:20,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:00:20,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:00:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:00:20,498 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 3 states. [2021-01-07 05:00:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,528 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2021-01-07 05:00:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:00:20,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-07 05:00:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,529 INFO L225 Difference]: With dead ends: 58 [2021-01-07 05:00:20,529 INFO L226 Difference]: Without dead ends: 58 [2021-01-07 05:00:20,530 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:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-07 05:00:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-01-07 05:00:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-01-07 05:00:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2021-01-07 05:00:20,534 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 10 [2021-01-07 05:00:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,534 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2021-01-07 05:00:20,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:00:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2021-01-07 05:00:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:00:20,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:00:20,536 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,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1656240800, now seen corresponding path program 1 times [2021-01-07 05:00:20,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553935189] [2021-01-07 05:00:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,603 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,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553935189] [2021-01-07 05:00:20,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:00:20,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128989636] [2021-01-07 05:00:20,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:20,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:20,607 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 5 states. [2021-01-07 05:00:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,701 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2021-01-07 05:00:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:00:20,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-07 05:00:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,704 INFO L225 Difference]: With dead ends: 125 [2021-01-07 05:00:20,704 INFO L226 Difference]: Without dead ends: 125 [2021-01-07 05:00:20,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-01-07 05:00:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 58. [2021-01-07 05:00:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-01-07 05:00:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2021-01-07 05:00:20,710 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 10 [2021-01-07 05:00:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,710 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2021-01-07 05:00:20,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2021-01-07 05:00:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:00:20,711 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:00:20,712 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,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash 613202235, now seen corresponding path program 1 times [2021-01-07 05:00:20,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507961785] [2021-01-07 05:00:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,753 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,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507961785] [2021-01-07 05:00:20,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:20,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:20,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10740716] [2021-01-07 05:00:20,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:20,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:20,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:20,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:20,755 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 4 states. [2021-01-07 05:00:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:20,792 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2021-01-07 05:00:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:20,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-01-07 05:00:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:20,793 INFO L225 Difference]: With dead ends: 57 [2021-01-07 05:00:20,793 INFO L226 Difference]: Without dead ends: 57 [2021-01-07 05:00:20,794 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,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-01-07 05:00:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-01-07 05:00:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-07 05:00:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2021-01-07 05:00:20,801 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 11 [2021-01-07 05:00:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:20,805 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2021-01-07 05:00:20,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2021-01-07 05:00:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-07 05:00:20,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:20,807 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:20,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:00:20,807 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:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:20,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1877967093, now seen corresponding path program 1 times [2021-01-07 05:00:20,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:20,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741711802] [2021-01-07 05:00:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:20,939 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,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741711802] [2021-01-07 05:00:20,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252911874] [2021-01-07 05:00:20,941 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,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:21,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 05:00:21,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:21,135 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_30|]} [2021-01-07 05:00:21,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:21,158 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:21,161 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:21,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:21,181 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:21,188 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:21,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:21,215 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:21,216 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:00:21,291 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,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:21,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:00:21,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940399004] [2021-01-07 05:00:21,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:00:21,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:00:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:21,295 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 7 states. [2021-01-07 05:00:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:21,448 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2021-01-07 05:00:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:00:21,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2021-01-07 05:00:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:21,450 INFO L225 Difference]: With dead ends: 90 [2021-01-07 05:00:21,450 INFO L226 Difference]: Without dead ends: 90 [2021-01-07 05:00:21,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-01-07 05:00:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2021-01-07 05:00:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:00:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2021-01-07 05:00:21,466 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 12 [2021-01-07 05:00:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:21,466 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2021-01-07 05:00:21,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:00:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2021-01-07 05:00:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:00:21,470 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:21,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:21,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 05:00:21,686 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,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash 876828511, now seen corresponding path program 1 times [2021-01-07 05:00:21,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:21,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250157858] [2021-01-07 05:00:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:21,731 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,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250157858] [2021-01-07 05:00:21,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:21,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:21,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603519360] [2021-01-07 05:00:21,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:21,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:21,733 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 4 states. [2021-01-07 05:00:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:21,774 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2021-01-07 05:00:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:21,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-01-07 05:00:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:21,776 INFO L225 Difference]: With dead ends: 49 [2021-01-07 05:00:21,776 INFO L226 Difference]: Without dead ends: 49 [2021-01-07 05:00:21,777 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,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-01-07 05:00:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-01-07 05:00:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2021-01-07 05:00:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2021-01-07 05:00:21,783 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 13 [2021-01-07 05:00:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:21,783 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2021-01-07 05:00:21,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2021-01-07 05:00:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:00:21,785 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:21,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:21,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:00:21,786 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,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 876828512, now seen corresponding path program 1 times [2021-01-07 05:00:21,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:21,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667186315] [2021-01-07 05:00:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:21,897 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,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667186315] [2021-01-07 05:00:21,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:21,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:00:21,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613899465] [2021-01-07 05:00:21,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:00:21,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:21,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:00:21,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:00:21,899 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 6 states. [2021-01-07 05:00:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,043 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2021-01-07 05:00:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:00:22,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2021-01-07 05:00:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,044 INFO L225 Difference]: With dead ends: 72 [2021-01-07 05:00:22,045 INFO L226 Difference]: Without dead ends: 72 [2021-01-07 05:00:22,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:00:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-07 05:00:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2021-01-07 05:00:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-07 05:00:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2021-01-07 05:00:22,053 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 13 [2021-01-07 05:00:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,053 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-01-07 05:00:22,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:00:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2021-01-07 05:00:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:00:22,055 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:22,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:00:22,056 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:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1541125411, now seen corresponding path program 1 times [2021-01-07 05:00:22,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:22,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847711104] [2021-01-07 05:00:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,141 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,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847711104] [2021-01-07 05:00:22,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:22,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:22,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978806494] [2021-01-07 05:00:22,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:22,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:22,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:22,147 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2021-01-07 05:00:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,223 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2021-01-07 05:00:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:22,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-01-07 05:00:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,228 INFO L225 Difference]: With dead ends: 99 [2021-01-07 05:00:22,228 INFO L226 Difference]: Without dead ends: 99 [2021-01-07 05:00:22,229 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:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-01-07 05:00:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2021-01-07 05:00:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-01-07 05:00:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2021-01-07 05:00:22,233 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 14 [2021-01-07 05:00:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,233 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2021-01-07 05:00:22,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2021-01-07 05:00:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-07 05:00:22,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:22,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:00:22,235 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,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash 818610617, now seen corresponding path program 1 times [2021-01-07 05:00:22,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:22,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381246262] [2021-01-07 05:00:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:22,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381246262] [2021-01-07 05:00:22,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543100625] [2021-01-07 05:00:22,310 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:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:22,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2021-01-07 05:00:22,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:22,467 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_31|]} [2021-01-07 05:00:22,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:22,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:22,472 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:00:22,490 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:22,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:22,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:22,506 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 5 treesize of output 3 [2021-01-07 05:00:22,508 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:22,521 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:22,534 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:00:22,534 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:29, output treesize:18 [2021-01-07 05:00:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:22,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:22,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-01-07 05:00:22,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971435389] [2021-01-07 05:00:22,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 05:00:22,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:22,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 05:00:22,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:00:22,728 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 13 states. [2021-01-07 05:00:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:22,987 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2021-01-07 05:00:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:00:22,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2021-01-07 05:00:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:22,988 INFO L225 Difference]: With dead ends: 85 [2021-01-07 05:00:22,988 INFO L226 Difference]: Without dead ends: 85 [2021-01-07 05:00:22,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:00:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-01-07 05:00:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2021-01-07 05:00:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-01-07 05:00:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2021-01-07 05:00:22,992 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 15 [2021-01-07 05:00:22,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:22,992 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2021-01-07 05:00:22,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 05:00:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2021-01-07 05:00:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:00:22,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:22,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:23,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:00:23,194 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:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 705742569, now seen corresponding path program 1 times [2021-01-07 05:00:23,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:23,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710761613] [2021-01-07 05:00:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:23,227 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:23,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710761613] [2021-01-07 05:00:23,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:23,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:00:23,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536196273] [2021-01-07 05:00:23,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:23,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:23,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:23,229 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 5 states. [2021-01-07 05:00:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:23,280 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2021-01-07 05:00:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:00:23,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-01-07 05:00:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:23,281 INFO L225 Difference]: With dead ends: 72 [2021-01-07 05:00:23,281 INFO L226 Difference]: Without dead ends: 72 [2021-01-07 05:00:23,282 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:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-07 05:00:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-01-07 05:00:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-07 05:00:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2021-01-07 05:00:23,284 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 17 [2021-01-07 05:00:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:23,285 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2021-01-07 05:00:23,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2021-01-07 05:00:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:00:23,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:23,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:23,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:00:23,286 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:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash 705742570, now seen corresponding path program 1 times [2021-01-07 05:00:23,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:23,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279001158] [2021-01-07 05:00:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:23,350 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:23,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279001158] [2021-01-07 05:00:23,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:23,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:00:23,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142413586] [2021-01-07 05:00:23,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:00:23,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:00:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:23,353 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand 7 states. [2021-01-07 05:00:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:23,442 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2021-01-07 05:00:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:00:23,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2021-01-07 05:00:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:23,444 INFO L225 Difference]: With dead ends: 97 [2021-01-07 05:00:23,444 INFO L226 Difference]: Without dead ends: 97 [2021-01-07 05:00:23,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:00:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-01-07 05:00:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2021-01-07 05:00:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-07 05:00:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2021-01-07 05:00:23,447 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 17 [2021-01-07 05:00:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:23,447 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2021-01-07 05:00:23,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:00:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2021-01-07 05:00:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:00:23,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:23,448 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:23,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:00:23,449 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:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash 705788370, now seen corresponding path program 2 times [2021-01-07 05:00:23,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:23,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365846172] [2021-01-07 05:00:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:23,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365846172] [2021-01-07 05:00:23,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:23,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:00:23,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691570534] [2021-01-07 05:00:23,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:00:23,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:23,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:00:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:23,629 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand 7 states. [2021-01-07 05:00:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:23,985 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2021-01-07 05:00:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:00:23,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2021-01-07 05:00:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:23,987 INFO L225 Difference]: With dead ends: 163 [2021-01-07 05:00:23,987 INFO L226 Difference]: Without dead ends: 163 [2021-01-07 05:00:23,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:00:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-07 05:00:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 86. [2021-01-07 05:00:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-07 05:00:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2021-01-07 05:00:23,992 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 17 [2021-01-07 05:00:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:23,993 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2021-01-07 05:00:23,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:00:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2021-01-07 05:00:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:00:23,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:23,994 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:23,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:00:23,994 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:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash -287041178, now seen corresponding path program 1 times [2021-01-07 05:00:23,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:23,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227293151] [2021-01-07 05:00:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:24,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227293151] [2021-01-07 05:00:24,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874082243] [2021-01-07 05:00:24,055 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,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:24,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 05:00:24,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:24,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:24,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-01-07 05:00:24,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537461998] [2021-01-07 05:00:24,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:00:24,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:00:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:00:24,209 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand 11 states. [2021-01-07 05:00:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:24,445 INFO L93 Difference]: Finished difference Result 302 states and 391 transitions. [2021-01-07 05:00:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:00:24,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2021-01-07 05:00:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:24,447 INFO L225 Difference]: With dead ends: 302 [2021-01-07 05:00:24,447 INFO L226 Difference]: Without dead ends: 302 [2021-01-07 05:00:24,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:00:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-07 05:00:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 95. [2021-01-07 05:00:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:00:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2021-01-07 05:00:24,457 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 18 [2021-01-07 05:00:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:24,458 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2021-01-07 05:00:24,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:00:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2021-01-07 05:00:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:00:24,458 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:24,459 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:24,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 05:00:24,674 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:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash -440236817, now seen corresponding path program 1 times [2021-01-07 05:00:24,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:24,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083436306] [2021-01-07 05:00:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:24,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083436306] [2021-01-07 05:00:24,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369758666] [2021-01-07 05:00:24,785 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:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:24,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:00:24,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:24,859 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_32|]} [2021-01-07 05:00:24,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:24,864 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,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:24,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:24,880 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,883 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:24,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:24,895 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,895 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:00:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:25,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:25,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-01-07 05:00:25,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919410048] [2021-01-07 05:00:25,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 05:00:25,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:25,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 05:00:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:00:25,007 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand 15 states. [2021-01-07 05:00:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:25,370 INFO L93 Difference]: Finished difference Result 171 states and 214 transitions. [2021-01-07 05:00:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:00:25,371 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2021-01-07 05:00:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:25,372 INFO L225 Difference]: With dead ends: 171 [2021-01-07 05:00:25,372 INFO L226 Difference]: Without dead ends: 171 [2021-01-07 05:00:25,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:00:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-01-07 05:00:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 107. [2021-01-07 05:00:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 05:00:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2021-01-07 05:00:25,376 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 21 [2021-01-07 05:00:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:25,376 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2021-01-07 05:00:25,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 05:00:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2021-01-07 05:00:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:00:25,377 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:25,377 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:25,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:25,579 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:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash 35317445, now seen corresponding path program 1 times [2021-01-07 05:00:25,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:25,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845464381] [2021-01-07 05:00:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:25,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845464381] [2021-01-07 05:00:25,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:25,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:00:25,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91115802] [2021-01-07 05:00:25,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:00:25,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:25,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:00:25,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:00:25,611 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand 5 states. [2021-01-07 05:00:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:25,651 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2021-01-07 05:00:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:00:25,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-07 05:00:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:25,652 INFO L225 Difference]: With dead ends: 125 [2021-01-07 05:00:25,652 INFO L226 Difference]: Without dead ends: 125 [2021-01-07 05:00:25,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:00:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-01-07 05:00:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2021-01-07 05:00:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-07 05:00:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2021-01-07 05:00:25,655 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 22 [2021-01-07 05:00:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:25,656 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2021-01-07 05:00:25,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:00:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2021-01-07 05:00:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:00:25,656 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:25,657 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:25,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:00:25,657 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:25,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:25,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1863163671, now seen corresponding path program 2 times [2021-01-07 05:00:25,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:25,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756063291] [2021-01-07 05:00:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:00:25,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756063291] [2021-01-07 05:00:25,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038276150] [2021-01-07 05:00:25,713 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:25,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:00:25,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:25,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 05:00:25,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:25,789 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:25,789 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:25,791 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:25,805 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2021-01-07 05:00:25,808 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:25,808 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2021-01-07 05:00:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:00:25,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:25,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:00:25,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781424545] [2021-01-07 05:00:25,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:00:25,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:25,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:00:25,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:00:25,848 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand 7 states. [2021-01-07 05:00:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:25,942 INFO L93 Difference]: Finished difference Result 164 states and 203 transitions. [2021-01-07 05:00:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:00:25,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2021-01-07 05:00:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:25,943 INFO L225 Difference]: With dead ends: 164 [2021-01-07 05:00:25,943 INFO L226 Difference]: Without dead ends: 164 [2021-01-07 05:00:25,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 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:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-01-07 05:00:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 100. [2021-01-07 05:00:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-01-07 05:00:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2021-01-07 05:00:25,947 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 22 [2021-01-07 05:00:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:25,948 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2021-01-07 05:00:25,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:00:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2021-01-07 05:00:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:00:25,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:25,948 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:26,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-07 05:00:26,163 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:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2134181768, now seen corresponding path program 2 times [2021-01-07 05:00:26,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:26,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435401458] [2021-01-07 05:00:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:26,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435401458] [2021-01-07 05:00:26,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955202258] [2021-01-07 05:00:26,363 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:26,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:00:26,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:26,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:00:26,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:26,463 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:26,465 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:26,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:26,470 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:26,470 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-01-07 05:00:26,556 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 17 treesize of output 13 [2021-01-07 05:00:26,557 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:26,565 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:26,567 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:26,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2021-01-07 05:00:26,611 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:26,614 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:26,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:26,628 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-01-07 05:00:26,628 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:41 [2021-01-07 05:00:26,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:00:26,875 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 31 treesize of output 10 [2021-01-07 05:00:26,877 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:26,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:26,891 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:26,891 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:56, output treesize:3 [2021-01-07 05:00:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:26,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:26,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2021-01-07 05:00:26,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107189527] [2021-01-07 05:00:26,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:00:26,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:00:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:00:26,919 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand 20 states. [2021-01-07 05:00:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:27,737 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2021-01-07 05:00:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:00:27,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2021-01-07 05:00:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:27,739 INFO L225 Difference]: With dead ends: 232 [2021-01-07 05:00:27,739 INFO L226 Difference]: Without dead ends: 232 [2021-01-07 05:00:27,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:00:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-01-07 05:00:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 111. [2021-01-07 05:00:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2021-01-07 05:00:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2021-01-07 05:00:27,744 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 23 [2021-01-07 05:00:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:27,744 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2021-01-07 05:00:27,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:00:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2021-01-07 05:00:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:00:27,745 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:27,745 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:27,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:27,946 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:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 79040412, now seen corresponding path program 1 times [2021-01-07 05:00:27,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:27,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590831139] [2021-01-07 05:00:27,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:28,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590831139] [2021-01-07 05:00:28,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813827022] [2021-01-07 05:00:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:28,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-07 05:00:28,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:28,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:00:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:28,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:28,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-01-07 05:00:28,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315482463] [2021-01-07 05:00:28,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:00:28,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:00:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:00:28,135 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand 6 states. [2021-01-07 05:00:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:28,200 INFO L93 Difference]: Finished difference Result 230 states and 275 transitions. [2021-01-07 05:00:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:00:28,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-07 05:00:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:28,202 INFO L225 Difference]: With dead ends: 230 [2021-01-07 05:00:28,202 INFO L226 Difference]: Without dead ends: 230 [2021-01-07 05:00:28,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:00:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-01-07 05:00:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 192. [2021-01-07 05:00:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2021-01-07 05:00:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 236 transitions. [2021-01-07 05:00:28,206 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 236 transitions. Word has length 23 [2021-01-07 05:00:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:28,207 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 236 transitions. [2021-01-07 05:00:28,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:00:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 236 transitions. [2021-01-07 05:00:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:00:28,209 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:28,209 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:28,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:00:28,422 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:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1609903330, now seen corresponding path program 1 times [2021-01-07 05:00:28,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:28,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155018117] [2021-01-07 05:00:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:28,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155018117] [2021-01-07 05:00:28,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:28,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:00:28,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177301838] [2021-01-07 05:00:28,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:00:28,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:28,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:00:28,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:00:28,530 INFO L87 Difference]: Start difference. First operand 192 states and 236 transitions. Second operand 9 states. [2021-01-07 05:00:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:28,706 INFO L93 Difference]: Finished difference Result 296 states and 353 transitions. [2021-01-07 05:00:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:00:28,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2021-01-07 05:00:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:28,709 INFO L225 Difference]: With dead ends: 296 [2021-01-07 05:00:28,709 INFO L226 Difference]: Without dead ends: 296 [2021-01-07 05:00:28,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:00:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-01-07 05:00:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 213. [2021-01-07 05:00:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2021-01-07 05:00:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 261 transitions. [2021-01-07 05:00:28,716 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 261 transitions. Word has length 23 [2021-01-07 05:00:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:28,716 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 261 transitions. [2021-01-07 05:00:28,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:00:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 261 transitions. [2021-01-07 05:00:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:00:28,717 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:28,717 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:28,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:00:28,718 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:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1867415516, now seen corresponding path program 1 times [2021-01-07 05:00:28,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:28,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526213476] [2021-01-07 05:00:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:28,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526213476] [2021-01-07 05:00:28,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:28,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:00:28,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800225680] [2021-01-07 05:00:28,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:00:28,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:28,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:00:28,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:00:28,844 INFO L87 Difference]: Start difference. First operand 213 states and 261 transitions. Second operand 10 states. [2021-01-07 05:00:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:29,027 INFO L93 Difference]: Finished difference Result 246 states and 294 transitions. [2021-01-07 05:00:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:00:29,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2021-01-07 05:00:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:29,029 INFO L225 Difference]: With dead ends: 246 [2021-01-07 05:00:29,029 INFO L226 Difference]: Without dead ends: 246 [2021-01-07 05:00:29,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:00:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-01-07 05:00:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 203. [2021-01-07 05:00:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2021-01-07 05:00:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2021-01-07 05:00:29,035 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 23 [2021-01-07 05:00:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:29,036 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2021-01-07 05:00:29,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:00:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2021-01-07 05:00:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:00:29,037 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:29,037 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] [2021-01-07 05:00:29,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 05:00:29,037 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:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:29,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1387621483, now seen corresponding path program 1 times [2021-01-07 05:00:29,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:29,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333125773] [2021-01-07 05:00:29,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:29,093 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:29,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333125773] [2021-01-07 05:00:29,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:29,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:00:29,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067013913] [2021-01-07 05:00:29,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:00:29,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:00:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:00:29,095 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand 4 states. [2021-01-07 05:00:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:29,118 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2021-01-07 05:00:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:00:29,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-01-07 05:00:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:29,120 INFO L225 Difference]: With dead ends: 202 [2021-01-07 05:00:29,120 INFO L226 Difference]: Without dead ends: 155 [2021-01-07 05:00:29,120 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:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-07 05:00:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-01-07 05:00:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-07 05:00:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2021-01-07 05:00:29,124 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 25 [2021-01-07 05:00:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:29,124 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2021-01-07 05:00:29,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:00:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2021-01-07 05:00:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:00:29,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:29,125 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:29,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 05:00:29,125 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:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash -725186331, now seen corresponding path program 3 times [2021-01-07 05:00:29,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:29,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488167281] [2021-01-07 05:00:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:29,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488167281] [2021-01-07 05:00:29,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309585655] [2021-01-07 05:00:29,237 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:29,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-07 05:00:29,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:29,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:00:29,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:29,317 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_34|]} [2021-01-07 05:00:29,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:00:29,324 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:29,325 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:29,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:29,337 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:29,338 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:29,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:29,349 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:29,349 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:00:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:00:29,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:00:29,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-01-07 05:00:29,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653736300] [2021-01-07 05:00:29,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:00:29,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:29,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:00:29,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:00:29,555 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand 19 states. [2021-01-07 05:00:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:30,045 INFO L93 Difference]: Finished difference Result 225 states and 257 transitions. [2021-01-07 05:00:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:00:30,045 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2021-01-07 05:00:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:30,046 INFO L225 Difference]: With dead ends: 225 [2021-01-07 05:00:30,047 INFO L226 Difference]: Without dead ends: 208 [2021-01-07 05:00:30,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:00:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-01-07 05:00:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 170. [2021-01-07 05:00:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2021-01-07 05:00:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2021-01-07 05:00:30,052 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 27 [2021-01-07 05:00:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:30,052 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2021-01-07 05:00:30,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:00:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2021-01-07 05:00:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:00:30,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:30,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:30,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 05:00:30,254 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:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash -424812231, now seen corresponding path program 1 times [2021-01-07 05:00:30,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:30,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902325542] [2021-01-07 05:00:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:30,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902325542] [2021-01-07 05:00:30,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:00:30,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 05:00:30,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391600191] [2021-01-07 05:00:30,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:00:30,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:00:30,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:00:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:00:30,387 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand 11 states. [2021-01-07 05:00:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:00:30,554 INFO L93 Difference]: Finished difference Result 261 states and 295 transitions. [2021-01-07 05:00:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:00:30,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2021-01-07 05:00:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:00:30,556 INFO L225 Difference]: With dead ends: 261 [2021-01-07 05:00:30,556 INFO L226 Difference]: Without dead ends: 224 [2021-01-07 05:00:30,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:00:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-01-07 05:00:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2021-01-07 05:00:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2021-01-07 05:00:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2021-01-07 05:00:30,561 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 27 [2021-01-07 05:00:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:00:30,561 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2021-01-07 05:00:30,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:00:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2021-01-07 05:00:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:00:30,562 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:00:30,562 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:00:30,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:00:30,562 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:30,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:00:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1119361538, now seen corresponding path program 4 times [2021-01-07 05:00:30,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:00:30,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656927484] [2021-01-07 05:00:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:00:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:00:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:00:30,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656927484] [2021-01-07 05:00:30,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217504788] [2021-01-07 05:00:30,742 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:30,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:00:30,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:00:30,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-07 05:00:30,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:00:30,864 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:30,864 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,865 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:30,894 INFO L625 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2021-01-07 05:00:30,895 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:00:30,895 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:27 [2021-01-07 05:00:31,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:00:31,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:00:31,105 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:31,106 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:31,110 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 18 treesize of output 14 [2021-01-07 05:00:31,111 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:31,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:31,136 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-01-07 05:00:31,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:66 [2021-01-07 05:00:35,210 WARN L197 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 39 [2021-01-07 05:00:35,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-07 05:00:35,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:00:35,263 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:35,263 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 69 [2021-01-07 05:00:35,265 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:35,323 INFO L625 ElimStorePlain]: treesize reduction 31, result has 73.3 percent of original size [2021-01-07 05:00:35,353 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:00:35,353 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 85 [2021-01-07 05:00:35,356 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:00:35,422 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.3 percent of original size [2021-01-07 05:00:35,426 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-01-07 05:00:35,426 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:81 [2021-01-07 05:00:39,568 WARN L197 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 49 [2021-01-07 05:00:41,715 WARN L197 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 49 [2021-01-07 05:00:47,866 WARN L197 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 51 [2021-01-07 05:00:47,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:00:54,042 WARN L197 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 51 [2021-01-07 05:00:54,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:00,246 WARN L197 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 52 [2021-01-07 05:01:00,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:00,296 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:00,296 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 66 [2021-01-07 05:01:00,299 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:00,322 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:00,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2021-01-07 05:01:00,324 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:01:00,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:01:00,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:01:00,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:01:00,374 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-01-07 05:01:00,374 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:101, output treesize:51 [2021-01-07 05:01:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:01:00,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:01:00,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2021-01-07 05:01:00,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730184240] [2021-01-07 05:01:00,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:01:00,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:01:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:01:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=580, Unknown=3, NotChecked=0, Total=650 [2021-01-07 05:01:00,537 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand 26 states. [2021-01-07 05:01:01,715 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2021-01-07 05:01:04,093 WARN L197 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2021-01-07 05:01:22,880 WARN L197 SmtUtils]: Spent 18.51 s on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2021-01-07 05:01:52,592 WARN L197 SmtUtils]: Spent 27.18 s on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2021-01-07 05:02:24,467 WARN L197 SmtUtils]: Spent 31.60 s on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2021-01-07 05:02:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:25,205 INFO L93 Difference]: Finished difference Result 407 states and 448 transitions. [2021-01-07 05:02:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-07 05:02:25,205 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2021-01-07 05:02:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:25,207 INFO L225 Difference]: With dead ends: 407 [2021-01-07 05:02:25,207 INFO L226 Difference]: Without dead ends: 361 [2021-01-07 05:02:25,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 110.5s TimeCoverageRelationStatistics Valid=427, Invalid=2650, Unknown=3, NotChecked=0, Total=3080 [2021-01-07 05:02:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-01-07 05:02:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 195. [2021-01-07 05:02:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-07 05:02:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 227 transitions. [2021-01-07 05:02:25,215 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 227 transitions. Word has length 29 [2021-01-07 05:02:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:25,215 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 227 transitions. [2021-01-07 05:02:25,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:02:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 227 transitions. [2021-01-07 05:02:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:02:25,216 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:25,216 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:25,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:02:25,418 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:02:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash 515027158, now seen corresponding path program 1 times [2021-01-07 05:02:25,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:25,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137149852] [2021-01-07 05:02:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:25,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137149852] [2021-01-07 05:02:25,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271880865] [2021-01-07 05:02:25,548 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 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:02:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:25,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 05:02:25,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:25,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:25,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-01-07 05:02:25,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721665367] [2021-01-07 05:02:25,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:02:25,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:25,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:02:25,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:02:25,718 INFO L87 Difference]: Start difference. First operand 195 states and 227 transitions. Second operand 16 states. [2021-01-07 05:02:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:26,096 INFO L93 Difference]: Finished difference Result 250 states and 280 transitions. [2021-01-07 05:02:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:02:26,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2021-01-07 05:02:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:26,098 INFO L225 Difference]: With dead ends: 250 [2021-01-07 05:02:26,098 INFO L226 Difference]: Without dead ends: 250 [2021-01-07 05:02:26,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:02:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-07 05:02:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 216. [2021-01-07 05:02:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-07 05:02:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2021-01-07 05:02:26,104 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 31 [2021-01-07 05:02:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:26,105 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2021-01-07 05:02:26,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:02:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2021-01-07 05:02:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:02:26,106 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:26,106 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:26,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:26,317 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:02:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash 496512411, now seen corresponding path program 5 times [2021-01-07 05:02:26,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:26,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914141199] [2021-01-07 05:02:26,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:26,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914141199] [2021-01-07 05:02:26,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546186582] [2021-01-07 05:02:26,488 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 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:02:26,562 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-01-07 05:02:26,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:26,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-07 05:02:26,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:26,594 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_35|]} [2021-01-07 05:02:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:02:26,600 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:26,602 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:26,612 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:26,618 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:26,620 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:26,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:26,631 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:02:26,631 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:02:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:26,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:26,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-01-07 05:02:26,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983222037] [2021-01-07 05:02:26,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:02:26,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:26,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:02:26,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:02:26,900 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand 23 states. [2021-01-07 05:02:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:27,873 INFO L93 Difference]: Finished difference Result 358 states and 403 transitions. [2021-01-07 05:02:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:02:27,874 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2021-01-07 05:02:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:27,876 INFO L225 Difference]: With dead ends: 358 [2021-01-07 05:02:27,876 INFO L226 Difference]: Without dead ends: 341 [2021-01-07 05:02:27,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:02:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-01-07 05:02:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 237. [2021-01-07 05:02:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2021-01-07 05:02:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 273 transitions. [2021-01-07 05:02:27,883 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 273 transitions. Word has length 33 [2021-01-07 05:02:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:27,884 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 273 transitions. [2021-01-07 05:02:27,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:02:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 273 transitions. [2021-01-07 05:02:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:02:27,884 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:27,885 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:28,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-07 05:02:28,098 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:02:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 407057716, now seen corresponding path program 6 times [2021-01-07 05:02:28,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:28,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761450129] [2021-01-07 05:02:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:28,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761450129] [2021-01-07 05:02:28,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922710560] [2021-01-07 05:02:28,336 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:02:28,398 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-01-07 05:02:28,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:28,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 53 conjunts are in the unsatisfiable core [2021-01-07 05:02:28,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:28,446 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:28,447 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:28,449 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:28,474 INFO L625 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2021-01-07 05:02:28,475 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:28,475 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2021-01-07 05:02:28,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:02:28,779 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 19 treesize of output 15 [2021-01-07 05:02:28,780 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:28,785 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 17 treesize of output 13 [2021-01-07 05:02:28,786 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:28,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:28,819 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-01-07 05:02:28,820 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:80 [2021-01-07 05:02:28,955 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:28,956 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 86 [2021-01-07 05:02:28,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:28,989 INFO L625 ElimStorePlain]: treesize reduction 48, result has 48.9 percent of original size [2021-01-07 05:02:28,991 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:28,992 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2021-01-07 05:02:29,498 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:29,498 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 49 [2021-01-07 05:02:29,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:02:29,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:02:29,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:02:29,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:02:29,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:02:29,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:02:29,514 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:29,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:29,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:02:29,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:02:29,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:02:29,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:02:29,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:02:29,556 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:02:29,556 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2021-01-07 05:02:29,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:02:29,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:02:29,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:02:29,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:02:29,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:02:29,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:02:29,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:02:29,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:02:29,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:02:29,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:02:31,812 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-01-07 05:02:31,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:02:31,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:02:31,847 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 14 [2021-01-07 05:02:31,848 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:31,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:31,863 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:02:31,863 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:3 [2021-01-07 05:02:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:31,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:31,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2021-01-07 05:02:31,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769632686] [2021-01-07 05:02:31,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-07 05:02:31,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-07 05:02:31,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:02:31,883 INFO L87 Difference]: Start difference. First operand 237 states and 273 transitions. Second operand 28 states. [2021-01-07 05:02:34,128 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2021-01-07 05:02:34,340 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-01-07 05:02:34,572 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2021-01-07 05:02:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:35,334 INFO L93 Difference]: Finished difference Result 518 states and 569 transitions. [2021-01-07 05:02:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-07 05:02:35,335 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2021-01-07 05:02:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:35,339 INFO L225 Difference]: With dead ends: 518 [2021-01-07 05:02:35,340 INFO L226 Difference]: Without dead ends: 477 [2021-01-07 05:02:35,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=339, Invalid=2417, Unknown=0, NotChecked=0, Total=2756 [2021-01-07 05:02:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-01-07 05:02:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 260. [2021-01-07 05:02:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2021-01-07 05:02:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 299 transitions. [2021-01-07 05:02:35,348 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 299 transitions. Word has length 35 [2021-01-07 05:02:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:35,348 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 299 transitions. [2021-01-07 05:02:35,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-07 05:02:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 299 transitions. [2021-01-07 05:02:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:02:35,349 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:35,349 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-01-07 05:02:35,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:35,563 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:02:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1933322104, now seen corresponding path program 2 times [2021-01-07 05:02:35,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:35,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757881726] [2021-01-07 05:02:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:35,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757881726] [2021-01-07 05:02:35,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270113948] [2021-01-07 05:02:35,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 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:02:35,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:02:35,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:35,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 44 conjunts are in the unsatisfiable core [2021-01-07 05:02:35,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:36,002 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:36,005 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:36,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:36,013 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:36,013 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-01-07 05:02:36,178 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:02:36,179 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:36,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:36,190 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:36,190 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2021-01-07 05:02:36,454 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 22 treesize of output 21 [2021-01-07 05:02:36,455 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:36,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:36,473 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:02:36,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:28 [2021-01-07 05:02:36,528 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:36,529 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:36,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:36,535 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:36,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2021-01-07 05:02:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:36,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:36,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2021-01-07 05:02:36,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519563386] [2021-01-07 05:02:36,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-07 05:02:36,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-07 05:02:36,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:02:36,549 INFO L87 Difference]: Start difference. First operand 260 states and 299 transitions. Second operand 24 states. [2021-01-07 05:02:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:37,706 INFO L93 Difference]: Finished difference Result 289 states and 327 transitions. [2021-01-07 05:02:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:02:37,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2021-01-07 05:02:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:37,707 INFO L225 Difference]: With dead ends: 289 [2021-01-07 05:02:37,707 INFO L226 Difference]: Without dead ends: 252 [2021-01-07 05:02:37,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2021-01-07 05:02:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-01-07 05:02:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2021-01-07 05:02:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-07 05:02:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 289 transitions. [2021-01-07 05:02:37,713 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 289 transitions. Word has length 37 [2021-01-07 05:02:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:37,713 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 289 transitions. [2021-01-07 05:02:37,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-07 05:02:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 289 transitions. [2021-01-07 05:02:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:02:37,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:37,714 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:37,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-01-07 05:02:37,930 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:02:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1211405073, now seen corresponding path program 7 times [2021-01-07 05:02:37,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:37,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295355005] [2021-01-07 05:02:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:38,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295355005] [2021-01-07 05:02:38,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966412109] [2021-01-07 05:02:38,122 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:02:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:38,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-07 05:02:38,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:38,200 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_37|]} [2021-01-07 05:02:38,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:02:38,204 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:38,205 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:38,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:38,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:02:38,219 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:38,228 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:38,230 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:02:38,230 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:02:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:02:38,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:38,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-01-07 05:02:38,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978433170] [2021-01-07 05:02:38,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:02:38,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:02:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:02:38,586 INFO L87 Difference]: Start difference. First operand 251 states and 289 transitions. Second operand 26 states. [2021-01-07 05:02:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:02:39,754 INFO L93 Difference]: Finished difference Result 426 states and 477 transitions. [2021-01-07 05:02:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:02:39,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2021-01-07 05:02:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:02:39,758 INFO L225 Difference]: With dead ends: 426 [2021-01-07 05:02:39,758 INFO L226 Difference]: Without dead ends: 409 [2021-01-07 05:02:39,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:02:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-01-07 05:02:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 272. [2021-01-07 05:02:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 05:02:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 312 transitions. [2021-01-07 05:02:39,766 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 312 transitions. Word has length 39 [2021-01-07 05:02:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:02:39,766 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 312 transitions. [2021-01-07 05:02:39,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:02:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 312 transitions. [2021-01-07 05:02:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:02:39,767 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:02:39,767 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:02:39,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:02:39,982 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:02:39,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:02:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash 224138538, now seen corresponding path program 8 times [2021-01-07 05:02:39,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:02:39,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929229767] [2021-01-07 05:02:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:02:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:02:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:40,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929229767] [2021-01-07 05:02:40,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330382792] [2021-01-07 05:02:40,259 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 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:02:40,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:02:40,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:02:40,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2021-01-07 05:02:40,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:02:40,341 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:40,342 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:40,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:40,346 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:40,346 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:02:40,570 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 17 treesize of output 13 [2021-01-07 05:02:40,574 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:40,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:40,584 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:40,585 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-01-07 05:02:40,671 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:02:40,673 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:02:40,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:40,684 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-01-07 05:02:40,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 [2021-01-07 05:02:41,595 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:02:41,596 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 31 treesize of output 24 [2021-01-07 05:02:41,598 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:02:41,613 INFO L625 ElimStorePlain]: treesize reduction 7, result has 72.0 percent of original size [2021-01-07 05:02:41,615 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:02:41,615 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:45, output treesize:3 [2021-01-07 05:02:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:02:41,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:02:41,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-01-07 05:02:41,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565237280] [2021-01-07 05:02:41,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:02:41,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:02:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:02:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:02:41,631 INFO L87 Difference]: Start difference. First operand 272 states and 312 transitions. Second operand 30 states. [2021-01-07 05:02:47,015 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:02:51,248 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:02:55,455 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:02:59,652 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:03:03,810 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-01-07 05:03:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:05,085 INFO L93 Difference]: Finished difference Result 568 states and 628 transitions. [2021-01-07 05:03:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:03:05,086 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2021-01-07 05:03:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:05,088 INFO L225 Difference]: With dead ends: 568 [2021-01-07 05:03:05,088 INFO L226 Difference]: Without dead ends: 534 [2021-01-07 05:03:05,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:03:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-01-07 05:03:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 295. [2021-01-07 05:03:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2021-01-07 05:03:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 338 transitions. [2021-01-07 05:03:05,097 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 338 transitions. Word has length 41 [2021-01-07 05:03:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:05,097 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 338 transitions. [2021-01-07 05:03:05,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:03:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 338 transitions. [2021-01-07 05:03:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:03:05,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:05,098 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:05,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-07 05:03:05,313 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:03:05,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash -103083227, now seen corresponding path program 3 times [2021-01-07 05:03:05,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:05,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873124262] [2021-01-07 05:03:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:03:05,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873124262] [2021-01-07 05:03:05,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175347864] [2021-01-07 05:03:05,689 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 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:03:05,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:03:05,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:05,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 63 conjunts are in the unsatisfiable core [2021-01-07 05:03:05,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:05,782 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:05,784 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:05,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:05,789 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:05,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-01-07 05:03:05,955 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:05,956 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:05,966 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:05,967 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:05,968 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2021-01-07 05:03:06,175 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 21 treesize of output 20 [2021-01-07 05:03:06,177 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:06,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:06,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:03:06,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2021-01-07 05:03:06,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:03:06,311 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:06,312 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 15 treesize of output 10 [2021-01-07 05:03:06,313 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:06,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:06,319 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:03:06,320 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:3 [2021-01-07 05:03:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:03:06,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:06,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2021-01-07 05:03:06,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065887865] [2021-01-07 05:03:06,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:03:06,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:03:06,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:03:06,334 INFO L87 Difference]: Start difference. First operand 295 states and 338 transitions. Second operand 26 states. [2021-01-07 05:03:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:07,751 INFO L93 Difference]: Finished difference Result 530 states and 585 transitions. [2021-01-07 05:03:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:03:07,752 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2021-01-07 05:03:07,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:07,753 INFO L225 Difference]: With dead ends: 530 [2021-01-07 05:03:07,754 INFO L226 Difference]: Without dead ends: 423 [2021-01-07 05:03:07,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:03:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-01-07 05:03:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 342. [2021-01-07 05:03:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2021-01-07 05:03:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 392 transitions. [2021-01-07 05:03:07,762 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 392 transitions. Word has length 41 [2021-01-07 05:03:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:07,762 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 392 transitions. [2021-01-07 05:03:07,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:03:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 392 transitions. [2021-01-07 05:03:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 05:03:07,763 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:07,763 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:07,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:07,977 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:03:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:07,978 INFO L82 PathProgramCache]: Analyzing trace with hash 315939143, now seen corresponding path program 9 times [2021-01-07 05:03:07,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:07,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778914190] [2021-01-07 05:03:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:08,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778914190] [2021-01-07 05:03:08,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252922566] [2021-01-07 05:03:08,272 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 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:03:08,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-01-07 05:03:08,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:08,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-07 05:03:08,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:08,417 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:08,418 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:08,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:08,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:08,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:03:08,689 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 17 treesize of output 13 [2021-01-07 05:03:08,690 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:08,698 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:08,699 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:03:08,700 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-01-07 05:03:08,781 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:03:08,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:08,792 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:08,794 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-01-07 05:03:08,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 [2021-01-07 05:03:10,114 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:10,114 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 31 treesize of output 24 [2021-01-07 05:03:10,118 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:03:10,135 INFO L625 ElimStorePlain]: treesize reduction 7, result has 72.0 percent of original size [2021-01-07 05:03:10,137 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:10,137 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:45, output treesize:3 [2021-01-07 05:03:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:10,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:10,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2021-01-07 05:03:10,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563435965] [2021-01-07 05:03:10,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-07 05:03:10,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-07 05:03:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1047, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:03:10,211 INFO L87 Difference]: Start difference. First operand 342 states and 392 transitions. Second operand 34 states. [2021-01-07 05:03:12,717 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2021-01-07 05:03:17,096 WARN L197 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2021-01-07 05:03:21,622 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-01-07 05:03:26,114 WARN L197 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2021-01-07 05:03:30,550 WARN L197 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2021-01-07 05:03:30,980 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-01-07 05:03:31,277 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2021-01-07 05:03:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:35,446 INFO L93 Difference]: Finished difference Result 850 states and 939 transitions. [2021-01-07 05:03:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-01-07 05:03:35,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2021-01-07 05:03:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:35,449 INFO L225 Difference]: With dead ends: 850 [2021-01-07 05:03:35,449 INFO L226 Difference]: Without dead ends: 749 [2021-01-07 05:03:35,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=538, Invalid=3752, Unknown=0, NotChecked=0, Total=4290 [2021-01-07 05:03:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-01-07 05:03:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 392. [2021-01-07 05:03:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2021-01-07 05:03:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 447 transitions. [2021-01-07 05:03:35,473 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 447 transitions. Word has length 45 [2021-01-07 05:03:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:35,473 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 447 transitions. [2021-01-07 05:03:35,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-07 05:03:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 447 transitions. [2021-01-07 05:03:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 05:03:35,474 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:35,474 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2021-01-07 05:03:35,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-01-07 05:03:35,690 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:03:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash 270674946, now seen corresponding path program 4 times [2021-01-07 05:03:35,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:35,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082603745] [2021-01-07 05:03:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:03:35,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082603745] [2021-01-07 05:03:35,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982540230] [2021-01-07 05:03:35,840 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 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:03:35,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:03:35,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:35,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 48 conjunts are in the unsatisfiable core [2021-01-07 05:03:35,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:35,913 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_41|]} [2021-01-07 05:03:35,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:35,917 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:03:35,918 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:35,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:35,930 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:35,932 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:35,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:35,941 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:35,941 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2021-01-07 05:03:35,996 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:03:35,996 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:36,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:36,004 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:36,004 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-01-07 05:03:36,102 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 23 treesize of output 22 [2021-01-07 05:03:36,103 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:36,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:36,112 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:03:36,112 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2021-01-07 05:03:36,193 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:36,193 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 21 treesize of output 21 [2021-01-07 05:03:36,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:03:36,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:36,204 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:36,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2021-01-07 05:03:36,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:36,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:03:36,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:36,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2021-01-07 05:03:36,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671306733] [2021-01-07 05:03:36,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-07 05:03:36,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-07 05:03:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:03:36,296 INFO L87 Difference]: Start difference. First operand 392 states and 447 transitions. Second operand 21 states. [2021-01-07 05:03:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:38,443 INFO L93 Difference]: Finished difference Result 480 states and 528 transitions. [2021-01-07 05:03:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-07 05:03:38,444 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2021-01-07 05:03:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:38,447 INFO L225 Difference]: With dead ends: 480 [2021-01-07 05:03:38,447 INFO L226 Difference]: Without dead ends: 480 [2021-01-07 05:03:38,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:03:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-01-07 05:03:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 333. [2021-01-07 05:03:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2021-01-07 05:03:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 380 transitions. [2021-01-07 05:03:38,460 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 380 transitions. Word has length 45 [2021-01-07 05:03:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:38,461 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 380 transitions. [2021-01-07 05:03:38,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-07 05:03:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 380 transitions. [2021-01-07 05:03:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 05:03:38,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:38,462 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2021-01-07 05:03:38,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-01-07 05:03:38,678 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:03:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1568194937, now seen corresponding path program 1 times [2021-01-07 05:03:38,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:38,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191888632] [2021-01-07 05:03:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:03:38,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191888632] [2021-01-07 05:03:38,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467676682] [2021-01-07 05:03:38,916 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 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:03:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:39,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 47 conjunts are in the unsatisfiable core [2021-01-07 05:03:39,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:39,041 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_42|]} [2021-01-07 05:03:39,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:39,047 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:03:39,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:39,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:39,068 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,070 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:39,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:39,089 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:03:39,089 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:03:39,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:03:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:03:39,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:39,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2021-01-07 05:03:39,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453816693] [2021-01-07 05:03:39,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 05:03:39,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:39,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 05:03:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:03:39,526 INFO L87 Difference]: Start difference. First operand 333 states and 380 transitions. Second operand 25 states. [2021-01-07 05:03:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:41,194 INFO L93 Difference]: Finished difference Result 581 states and 639 transitions. [2021-01-07 05:03:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:03:41,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2021-01-07 05:03:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:41,197 INFO L225 Difference]: With dead ends: 581 [2021-01-07 05:03:41,197 INFO L226 Difference]: Without dead ends: 569 [2021-01-07 05:03:41,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=1541, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:03:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-01-07 05:03:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379. [2021-01-07 05:03:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2021-01-07 05:03:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 435 transitions. [2021-01-07 05:03:41,206 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 435 transitions. Word has length 50 [2021-01-07 05:03:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:41,206 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 435 transitions. [2021-01-07 05:03:41,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-07 05:03:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 435 transitions. [2021-01-07 05:03:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 05:03:41,207 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:41,207 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:41,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-07 05:03:41,420 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:03:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:41,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1171395, now seen corresponding path program 10 times [2021-01-07 05:03:41,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:41,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810048969] [2021-01-07 05:03:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:41,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810048969] [2021-01-07 05:03:41,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829674248] [2021-01-07 05:03:41,759 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 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:03:41,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:03:41,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:41,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-07 05:03:41,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:41,882 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_43|]} [2021-01-07 05:03:41,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:41,886 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:03:41,887 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:41,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:41,901 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:41,902 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:41,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:41,913 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:41,913 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-01-07 05:03:41,992 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:03:41,993 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:42,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:42,002 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:42,002 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-01-07 05:03:42,044 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:03:42,045 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:42,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:42,056 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:03:42,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-01-07 05:03:42,602 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:42,603 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 31 treesize of output 22 [2021-01-07 05:03:42,605 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:03:42,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:42,616 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:03:42,616 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2021-01-07 05:03:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-01-07 05:03:42,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:42,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-01-07 05:03:42,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537111230] [2021-01-07 05:03:42,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-07 05:03:42,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-07 05:03:42,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2021-01-07 05:03:42,760 INFO L87 Difference]: Start difference. First operand 379 states and 435 transitions. Second operand 32 states. [2021-01-07 05:03:44,456 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-07 05:03:44,813 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-07 05:03:45,301 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-07 05:03:45,834 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2021-01-07 05:03:46,406 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2021-01-07 05:03:46,746 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2021-01-07 05:03:47,016 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2021-01-07 05:03:47,383 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-01-07 05:03:47,659 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2021-01-07 05:03:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:49,303 INFO L93 Difference]: Finished difference Result 726 states and 793 transitions. [2021-01-07 05:03:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-01-07 05:03:49,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2021-01-07 05:03:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:49,307 INFO L225 Difference]: With dead ends: 726 [2021-01-07 05:03:49,307 INFO L226 Difference]: Without dead ends: 584 [2021-01-07 05:03:49,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=901, Invalid=3655, Unknown=0, NotChecked=0, Total=4556 [2021-01-07 05:03:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-01-07 05:03:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 332. [2021-01-07 05:03:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2021-01-07 05:03:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 379 transitions. [2021-01-07 05:03:49,316 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 379 transitions. Word has length 51 [2021-01-07 05:03:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:49,316 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 379 transitions. [2021-01-07 05:03:49,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-07 05:03:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 379 transitions. [2021-01-07 05:03:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:03:49,317 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:49,318 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:49,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-01-07 05:03:49,533 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:03:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1141228712, now seen corresponding path program 1 times [2021-01-07 05:03:49,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:49,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284195684] [2021-01-07 05:03:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 21 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:49,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284195684] [2021-01-07 05:03:49,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380009078] [2021-01-07 05:03:49,941 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 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:03:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:50,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 61 conjunts are in the unsatisfiable core [2021-01-07 05:03:50,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:50,035 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:50,037 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:50,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:50,041 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:50,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:03:50,416 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 17 treesize of output 13 [2021-01-07 05:03:50,417 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:50,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:50,427 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:03:50,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-01-07 05:03:50,529 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:03:50,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:50,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:50,544 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-01-07 05:03:50,544 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 [2021-01-07 05:03:52,148 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:52,148 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 31 treesize of output 24 [2021-01-07 05:03:52,150 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:03:52,168 INFO L625 ElimStorePlain]: treesize reduction 7, result has 72.0 percent of original size [2021-01-07 05:03:52,171 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:52,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:45, output treesize:3 [2021-01-07 05:03:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 21 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:03:52,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:52,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2021-01-07 05:03:52,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275156285] [2021-01-07 05:03:52,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-07 05:03:52,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:52,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-07 05:03:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1314, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:03:52,188 INFO L87 Difference]: Start difference. First operand 332 states and 379 transitions. Second operand 38 states. [2021-01-07 05:03:58,841 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:04:03,238 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:04:07,599 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:04:11,919 WARN L197 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:04:16,203 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:04:20,482 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:04:24,688 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-01-07 05:04:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:27,110 INFO L93 Difference]: Finished difference Result 768 states and 833 transitions. [2021-01-07 05:04:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-07 05:04:27,111 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2021-01-07 05:04:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:27,115 INFO L225 Difference]: With dead ends: 768 [2021-01-07 05:04:27,115 INFO L226 Difference]: Without dead ends: 732 [2021-01-07 05:04:27,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=301, Invalid=2779, Unknown=0, NotChecked=0, Total=3080 [2021-01-07 05:04:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-01-07 05:04:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 361. [2021-01-07 05:04:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2021-01-07 05:04:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 414 transitions. [2021-01-07 05:04:27,124 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 414 transitions. Word has length 53 [2021-01-07 05:04:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:27,124 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 414 transitions. [2021-01-07 05:04:27,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-07 05:04:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 414 transitions. [2021-01-07 05:04:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 05:04:27,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:27,126 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:27,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:27,340 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:04:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash -511118732, now seen corresponding path program 1 times [2021-01-07 05:04:27,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:27,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827637088] [2021-01-07 05:04:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 05:04:27,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827637088] [2021-01-07 05:04:27,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126258166] [2021-01-07 05:04:27,526 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 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:04:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:27,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:04:27,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:27,630 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:27,631 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:04:27,632 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:27,655 INFO L625 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2021-01-07 05:04:27,657 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:04:27,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:11 [2021-01-07 05:04:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 05:04:27,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:27,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-01-07 05:04:27,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302631718] [2021-01-07 05:04:27,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:04:27,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:04:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:04:27,947 INFO L87 Difference]: Start difference. First operand 361 states and 414 transitions. Second operand 23 states. [2021-01-07 05:04:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:28,735 INFO L93 Difference]: Finished difference Result 403 states and 454 transitions. [2021-01-07 05:04:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:04:28,736 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2021-01-07 05:04:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:28,739 INFO L225 Difference]: With dead ends: 403 [2021-01-07 05:04:28,739 INFO L226 Difference]: Without dead ends: 342 [2021-01-07 05:04:28,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:04:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-07 05:04:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-01-07 05:04:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2021-01-07 05:04:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 391 transitions. [2021-01-07 05:04:28,745 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 391 transitions. Word has length 54 [2021-01-07 05:04:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:28,745 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 391 transitions. [2021-01-07 05:04:28,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:04:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 391 transitions. [2021-01-07 05:04:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:04:28,746 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:28,747 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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:04:28,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:28,962 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:04:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash 37563779, now seen corresponding path program 2 times [2021-01-07 05:04:28,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:28,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21686290] [2021-01-07 05:04:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:04:29,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21686290] [2021-01-07 05:04:29,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068921475] [2021-01-07 05:04:29,230 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 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:04:29,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:04:29,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:29,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 53 conjunts are in the unsatisfiable core [2021-01-07 05:04:29,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:29,340 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_35|], 1=[|v_#valid_45|]} [2021-01-07 05:04:29,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:29,344 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:04:29,345 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:29,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:29,360 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:04:29,362 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:29,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:29,374 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:04:29,374 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:04:29,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:04:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 05:04:29,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:29,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2021-01-07 05:04:29,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985714735] [2021-01-07 05:04:29,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-07 05:04:29,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-07 05:04:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:04:29,932 INFO L87 Difference]: Start difference. First operand 342 states and 391 transitions. Second operand 29 states. [2021-01-07 05:04:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:33,473 INFO L93 Difference]: Finished difference Result 651 states and 703 transitions. [2021-01-07 05:04:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-01-07 05:04:33,474 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2021-01-07 05:04:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:33,477 INFO L225 Difference]: With dead ends: 651 [2021-01-07 05:04:33,477 INFO L226 Difference]: Without dead ends: 643 [2021-01-07 05:04:33,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=866, Invalid=3690, Unknown=0, NotChecked=0, Total=4556 [2021-01-07 05:04:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-01-07 05:04:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 342. [2021-01-07 05:04:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2021-01-07 05:04:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 393 transitions. [2021-01-07 05:04:33,485 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 393 transitions. Word has length 56 [2021-01-07 05:04:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:33,485 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 393 transitions. [2021-01-07 05:04:33,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-07 05:04:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 393 transitions. [2021-01-07 05:04:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 05:04:33,486 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:33,486 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:33,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-01-07 05:04:33,701 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:04:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1096357131, now seen corresponding path program 2 times [2021-01-07 05:04:33,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:33,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494206744] [2021-01-07 05:04:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 45 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:34,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494206744] [2021-01-07 05:04:34,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609773838] [2021-01-07 05:04:34,094 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 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:04:34,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:04:34,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:34,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 61 conjunts are in the unsatisfiable core [2021-01-07 05:04:34,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:34,183 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_46|]} [2021-01-07 05:04:34,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:34,187 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:04:34,187 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:34,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:34,205 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:04:34,207 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:34,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:34,220 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:04:34,221 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2021-01-07 05:04:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 66 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:35,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:35,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2021-01-07 05:04:35,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625055795] [2021-01-07 05:04:35,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-07 05:04:35,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-07 05:04:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1276, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:04:35,007 INFO L87 Difference]: Start difference. First operand 342 states and 393 transitions. Second operand 38 states. [2021-01-07 05:04:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:37,541 INFO L93 Difference]: Finished difference Result 653 states and 717 transitions. [2021-01-07 05:04:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:04:37,544 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 57 [2021-01-07 05:04:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:37,547 INFO L225 Difference]: With dead ends: 653 [2021-01-07 05:04:37,547 INFO L226 Difference]: Without dead ends: 636 [2021-01-07 05:04:37,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=488, Invalid=2374, Unknown=0, NotChecked=0, Total=2862 [2021-01-07 05:04:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-01-07 05:04:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 360. [2021-01-07 05:04:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-01-07 05:04:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 412 transitions. [2021-01-07 05:04:37,555 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 412 transitions. Word has length 57 [2021-01-07 05:04:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:37,556 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 412 transitions. [2021-01-07 05:04:37,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-07 05:04:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 412 transitions. [2021-01-07 05:04:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 05:04:37,557 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:37,557 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:37,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:37,772 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:04:37,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1332214770, now seen corresponding path program 3 times [2021-01-07 05:04:37,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:37,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57323973] [2021-01-07 05:04:37,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 147 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:04:38,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57323973] [2021-01-07 05:04:38,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569280898] [2021-01-07 05:04:38,254 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 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:04:38,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-01-07 05:04:38,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:38,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 68 conjunts are in the unsatisfiable core [2021-01-07 05:04:38,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:38,396 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:04:38,397 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:38,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:38,402 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:38,402 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2021-01-07 05:04:38,855 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 17 treesize of output 13 [2021-01-07 05:04:38,856 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:38,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:38,867 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:04:38,867 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-01-07 05:04:38,968 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:04:38,969 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:38,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:38,983 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:38,983 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38