/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/openbsd_cstrcat-alloca-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:03:21,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:03:21,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:03:21,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:03:21,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:03:21,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:03:21,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:03:21,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:03:21,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:03:21,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:03:21,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:03:21,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:03:21,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:03:21,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:03:21,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:03:21,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:03:21,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:03:21,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:03:21,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:03:21,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:03:21,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:03:21,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:03:21,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:03:21,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:03:21,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:03:21,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:03:21,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:03:21,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:03:21,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:03:21,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:03:21,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:03:21,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:03:21,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:03:21,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:03:21,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:03:21,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:03:21,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:03:21,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:03:21,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:03:21,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:03:21,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:03:21,622 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:03:21,682 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:03:21,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:03:21,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:03:21,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:03:21,690 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:03:21,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:03:21,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:03:21,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:03:21,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:03:21,692 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:03:21,693 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:03:21,693 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:03:21,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:03:21,694 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:03:21,695 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:03:21,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:03:21,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:03:21,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:03:21,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:03:21,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:03:21,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:03:21,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:03:21,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:03:21,697 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:03:21,697 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:03:22,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:03:22,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:03:22,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:03:22,227 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:03:22,228 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:03:22,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2021-01-07 05:03:22,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eeca31d60/e2768d4e9601497c8ba27193d52a163c/FLAGc88810142 [2021-01-07 05:03:23,210 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:03:23,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2021-01-07 05:03:23,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eeca31d60/e2768d4e9601497c8ba27193d52a163c/FLAGc88810142 [2021-01-07 05:03:23,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eeca31d60/e2768d4e9601497c8ba27193d52a163c [2021-01-07 05:03:23,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:03:23,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:03:23,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:03:23,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:03:23,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:03:23,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:03:23" (1/1) ... [2021-01-07 05:03:23,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa35949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:23, skipping insertion in model container [2021-01-07 05:03:23,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:03:23" (1/1) ... [2021-01-07 05:03:23,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:03:23,582 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: IdentifierExpression[#t~post4,] 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[~length3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],IdentifierExpression[~i~1,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length1~0,],IntegerLiteral[1]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length3~0,],IntegerLiteral[1]]]]] [2021-01-07 05:03:23,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:03:24,014 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: IdentifierExpression[#t~post4,] 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[~length3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],IdentifierExpression[~i~1,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString1~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length1~0,],IntegerLiteral[1]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nondetString2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~nondetString2~0,],offset],BinaryExpression[ARITHMINUS,IdentifierExpression[~length3~0,],IntegerLiteral[1]]]]] [2021-01-07 05:03:24,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:03:24,166 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:03:24,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24 WrapperNode [2021-01-07 05:03:24,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:03:24,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:03:24,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:03:24,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:03:24,178 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:03:24" (1/1) ... [2021-01-07 05:03:24,195 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:03:24" (1/1) ... [2021-01-07 05:03:24,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:03:24,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:03:24,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:03:24,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:03:24,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (1/1) ... [2021-01-07 05:03:24,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (1/1) ... [2021-01-07 05:03:24,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (1/1) ... [2021-01-07 05:03:24,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (1/1) ... [2021-01-07 05:03:24,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (1/1) ... [2021-01-07 05:03:24,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (1/1) ... [2021-01-07 05:03:24,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (1/1) ... [2021-01-07 05:03:24,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:03:24,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:03:24,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:03:24,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:03:24,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (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:03:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:03:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:03:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:03:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:03:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:03:24,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:03:24,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:03:24,940 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-07 05:03:24,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:03:24 BoogieIcfgContainer [2021-01-07 05:03:24,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:03:24,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:03:24,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:03:24,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:03:24,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:03:23" (1/3) ... [2021-01-07 05:03:24,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ba1a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:03:24, skipping insertion in model container [2021-01-07 05:03:24,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:03:24" (2/3) ... [2021-01-07 05:03:24,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ba1a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:03:24, skipping insertion in model container [2021-01-07 05:03:24,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:03:24" (3/3) ... [2021-01-07 05:03:24,954 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca-2.i [2021-01-07 05:03:24,962 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:03:24,970 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2021-01-07 05:03:24,995 INFO L253 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2021-01-07 05:03:25,024 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:03:25,025 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:03:25,025 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:03:25,025 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:03:25,025 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:03:25,025 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:03:25,026 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:03:25,026 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:03:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2021-01-07 05:03:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:03:25,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:25,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:25,054 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:25,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1805031099, now seen corresponding path program 1 times [2021-01-07 05:03:25,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:25,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209800136] [2021-01-07 05:03:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:25,328 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:03:25,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209800136] [2021-01-07 05:03:25,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:25,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:03:25,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425981207] [2021-01-07 05:03:25,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:03:25,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:03:25,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:03:25,364 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2021-01-07 05:03:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:25,530 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2021-01-07 05:03:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:03:25,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2021-01-07 05:03:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:25,548 INFO L225 Difference]: With dead ends: 127 [2021-01-07 05:03:25,548 INFO L226 Difference]: Without dead ends: 121 [2021-01-07 05:03:25,551 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:03:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-01-07 05:03:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 46. [2021-01-07 05:03:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-07 05:03:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2021-01-07 05:03:25,602 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 7 [2021-01-07 05:03:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:25,602 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-01-07 05:03:25,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:03:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2021-01-07 05:03:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:03:25,603 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:25,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:25,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:03:25,604 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1805033021, now seen corresponding path program 1 times [2021-01-07 05:03:25,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:25,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304389266] [2021-01-07 05:03:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:25,670 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:03:25,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304389266] [2021-01-07 05:03:25,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:25,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:03:25,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695965206] [2021-01-07 05:03:25,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:03:25,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:03:25,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:03:25,680 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 3 states. [2021-01-07 05:03:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:25,742 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2021-01-07 05:03:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:03:25,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-07 05:03:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:25,748 INFO L225 Difference]: With dead ends: 47 [2021-01-07 05:03:25,748 INFO L226 Difference]: Without dead ends: 46 [2021-01-07 05:03:25,749 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:03:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-07 05:03:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2021-01-07 05:03:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-01-07 05:03:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2021-01-07 05:03:25,768 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2021-01-07 05:03:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:25,768 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2021-01-07 05:03:25,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:03:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2021-01-07 05:03:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:03:25,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:25,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:25,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:03:25,771 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 121388915, now seen corresponding path program 1 times [2021-01-07 05:03:25,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:25,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618389371] [2021-01-07 05:03:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:25,871 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:03:25,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618389371] [2021-01-07 05:03:25,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:25,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:03:25,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144322945] [2021-01-07 05:03:25,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:25,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:03:25,875 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2021-01-07 05:03:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:25,903 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2021-01-07 05:03:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:25,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:03:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:25,905 INFO L225 Difference]: With dead ends: 78 [2021-01-07 05:03:25,906 INFO L226 Difference]: Without dead ends: 78 [2021-01-07 05:03:25,906 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:03:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-07 05:03:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 47. [2021-01-07 05:03:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-01-07 05:03:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2021-01-07 05:03:25,912 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 8 [2021-01-07 05:03:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:25,913 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2021-01-07 05:03:25,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2021-01-07 05:03:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:03:25,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:25,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:25,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:03:25,915 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:25,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash 178647217, now seen corresponding path program 1 times [2021-01-07 05:03:25,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:25,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471159544] [2021-01-07 05:03:25,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:25,972 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:03:25,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471159544] [2021-01-07 05:03:25,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:25,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:03:25,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83511226] [2021-01-07 05:03:25,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:03:25,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:25,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:03:25,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:03:25,976 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2021-01-07 05:03:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:26,062 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2021-01-07 05:03:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:03:26,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-01-07 05:03:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:26,064 INFO L225 Difference]: With dead ends: 84 [2021-01-07 05:03:26,064 INFO L226 Difference]: Without dead ends: 84 [2021-01-07 05:03:26,065 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:03:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-07 05:03:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2021-01-07 05:03:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-01-07 05:03:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2021-01-07 05:03:26,070 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 8 [2021-01-07 05:03:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:26,071 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2021-01-07 05:03:26,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:03:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2021-01-07 05:03:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:03:26,072 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:26,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:26,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:03:26,100 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash 180494259, now seen corresponding path program 1 times [2021-01-07 05:03:26,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:26,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133223665] [2021-01-07 05:03:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:26,203 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:03:26,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133223665] [2021-01-07 05:03:26,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:26,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:03:26,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895458567] [2021-01-07 05:03:26,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:03:26,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:03:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:03:26,206 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 3 states. [2021-01-07 05:03:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:26,239 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-01-07 05:03:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:03:26,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 05:03:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:26,241 INFO L225 Difference]: With dead ends: 45 [2021-01-07 05:03:26,241 INFO L226 Difference]: Without dead ends: 45 [2021-01-07 05:03:26,242 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:03:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-01-07 05:03:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-01-07 05:03:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-01-07 05:03:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2021-01-07 05:03:26,246 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 8 [2021-01-07 05:03:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:26,246 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2021-01-07 05:03:26,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:03:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2021-01-07 05:03:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:03:26,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:26,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:26,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:03:26,248 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 180494260, now seen corresponding path program 1 times [2021-01-07 05:03:26,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:26,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710007101] [2021-01-07 05:03:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:26,333 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:03:26,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710007101] [2021-01-07 05:03:26,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:26,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:03:26,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183440646] [2021-01-07 05:03:26,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:26,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:03:26,340 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 4 states. [2021-01-07 05:03:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:26,438 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2021-01-07 05:03:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:26,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:03:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:26,439 INFO L225 Difference]: With dead ends: 79 [2021-01-07 05:03:26,439 INFO L226 Difference]: Without dead ends: 79 [2021-01-07 05:03:26,440 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:03:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-01-07 05:03:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2021-01-07 05:03:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-01-07 05:03:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2021-01-07 05:03:26,457 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 8 [2021-01-07 05:03:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:26,458 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2021-01-07 05:03:26,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2021-01-07 05:03:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:03:26,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:26,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:26,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:03:26,461 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash 690580011, now seen corresponding path program 1 times [2021-01-07 05:03:26,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:26,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865303337] [2021-01-07 05:03:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:26,570 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:03:26,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865303337] [2021-01-07 05:03:26,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:26,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:03:26,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666111528] [2021-01-07 05:03:26,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:26,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:26,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:03:26,573 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 4 states. [2021-01-07 05:03:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:26,614 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-01-07 05:03:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:26,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 05:03:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:26,618 INFO L225 Difference]: With dead ends: 46 [2021-01-07 05:03:26,618 INFO L226 Difference]: Without dead ends: 46 [2021-01-07 05:03:26,619 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:03:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-07 05:03:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-01-07 05:03:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-07 05:03:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2021-01-07 05:03:26,626 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 10 [2021-01-07 05:03:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:26,626 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-01-07 05:03:26,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2021-01-07 05:03:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:03:26,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:26,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:26,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:03:26,629 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash 690580063, now seen corresponding path program 1 times [2021-01-07 05:03:26,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:26,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917070742] [2021-01-07 05:03:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:26,702 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:03:26,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917070742] [2021-01-07 05:03:26,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:26,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:03:26,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643706887] [2021-01-07 05:03:26,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:26,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:26,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:03:26,705 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 4 states. [2021-01-07 05:03:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:26,729 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2021-01-07 05:03:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:26,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 05:03:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:26,730 INFO L225 Difference]: With dead ends: 80 [2021-01-07 05:03:26,730 INFO L226 Difference]: Without dead ends: 80 [2021-01-07 05:03:26,731 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:03:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-07 05:03:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2021-01-07 05:03:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-07 05:03:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2021-01-07 05:03:26,744 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 10 [2021-01-07 05:03:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:26,751 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2021-01-07 05:03:26,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2021-01-07 05:03:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:03:26,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:26,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:26,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:03:26,753 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 747838365, now seen corresponding path program 1 times [2021-01-07 05:03:26,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:26,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647868623] [2021-01-07 05:03:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:26,803 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:03:26,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647868623] [2021-01-07 05:03:26,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:26,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:03:26,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056554558] [2021-01-07 05:03:26,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:03:26,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:26,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:03:26,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:03:26,808 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2021-01-07 05:03:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:26,833 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-01-07 05:03:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:03:26,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-07 05:03:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:26,834 INFO L225 Difference]: With dead ends: 55 [2021-01-07 05:03:26,835 INFO L226 Difference]: Without dead ends: 55 [2021-01-07 05:03:26,835 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:03:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-01-07 05:03:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-01-07 05:03:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-07 05:03:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2021-01-07 05:03:26,843 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 10 [2021-01-07 05:03:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:26,843 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2021-01-07 05:03:26,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:03:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-01-07 05:03:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:03:26,845 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:26,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:26,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:03:26,845 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash 747838366, now seen corresponding path program 1 times [2021-01-07 05:03:26,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:26,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963027837] [2021-01-07 05:03:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:26,928 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:03:26,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963027837] [2021-01-07 05:03:26,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:26,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:03:26,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243605727] [2021-01-07 05:03:26,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:03:26,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:03:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:03:26,931 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 6 states. [2021-01-07 05:03:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:27,029 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2021-01-07 05:03:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:03:27,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-01-07 05:03:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:27,031 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:03:27,031 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:03:27,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:03:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:03:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 56. [2021-01-07 05:03:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-07 05:03:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2021-01-07 05:03:27,034 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 10 [2021-01-07 05:03:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:27,035 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-01-07 05:03:27,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:03:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2021-01-07 05:03:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:03:27,036 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:27,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:27,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:03:27,036 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1772121568, now seen corresponding path program 1 times [2021-01-07 05:03:27,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:27,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183073726] [2021-01-07 05:03:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:27,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:03:27,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183073726] [2021-01-07 05:03:27,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:27,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:03:27,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096595843] [2021-01-07 05:03:27,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:03:27,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:03:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:03:27,096 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 6 states. [2021-01-07 05:03:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:27,243 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2021-01-07 05:03:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:03:27,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-01-07 05:03:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:27,245 INFO L225 Difference]: With dead ends: 81 [2021-01-07 05:03:27,245 INFO L226 Difference]: Without dead ends: 81 [2021-01-07 05:03:27,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:03:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-07 05:03:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2021-01-07 05:03:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-01-07 05:03:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2021-01-07 05:03:27,249 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 10 [2021-01-07 05:03:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:27,249 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2021-01-07 05:03:27,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:03:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2021-01-07 05:03:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:03:27,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:27,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:27,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:03:27,251 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash -66856135, now seen corresponding path program 1 times [2021-01-07 05:03:27,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:27,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140603913] [2021-01-07 05:03:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:27,310 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:03:27,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140603913] [2021-01-07 05:03:27,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:27,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:03:27,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974624131] [2021-01-07 05:03:27,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:03:27,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:03:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:03:27,314 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2021-01-07 05:03:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:27,397 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2021-01-07 05:03:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:03:27,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-07 05:03:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:27,398 INFO L225 Difference]: With dead ends: 83 [2021-01-07 05:03:27,398 INFO L226 Difference]: Without dead ends: 83 [2021-01-07 05:03:27,399 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:03:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-07 05:03:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2021-01-07 05:03:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-07 05:03:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2021-01-07 05:03:27,402 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 11 [2021-01-07 05:03:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:27,402 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2021-01-07 05:03:27,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:03:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2021-01-07 05:03:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:03:27,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:27,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:27,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:03:27,404 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1708151227, now seen corresponding path program 1 times [2021-01-07 05:03:27,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:27,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985215960] [2021-01-07 05:03:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:27,446 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:03:27,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985215960] [2021-01-07 05:03:27,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:27,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:03:27,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952290892] [2021-01-07 05:03:27,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:03:27,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:27,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:03:27,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:03:27,449 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 5 states. [2021-01-07 05:03:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:27,493 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2021-01-07 05:03:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:03:27,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-07 05:03:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:27,494 INFO L225 Difference]: With dead ends: 63 [2021-01-07 05:03:27,494 INFO L226 Difference]: Without dead ends: 63 [2021-01-07 05:03:27,494 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:03:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-01-07 05:03:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2021-01-07 05:03:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-07 05:03:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2021-01-07 05:03:27,497 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 11 [2021-01-07 05:03:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:27,497 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2021-01-07 05:03:27,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:03:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2021-01-07 05:03:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-07 05:03:27,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:27,498 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:27,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:03:27,499 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:27,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1736941833, now seen corresponding path program 1 times [2021-01-07 05:03:27,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:27,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462987299] [2021-01-07 05:03:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:27,558 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:03:27,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462987299] [2021-01-07 05:03:27,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120666588] [2021-01-07 05:03:27,559 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:03:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:27,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-07 05:03:27,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:27,708 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_26|]} [2021-01-07 05:03:27,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:27,738 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:27,747 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:27,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:27,783 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:27,808 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:27,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:27,829 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:27,829 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2021-01-07 05:03:27,897 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:03:27,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:27,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 05:03:27,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349233552] [2021-01-07 05:03:27,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:03:27,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:03:27,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:03:27,900 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 6 states. [2021-01-07 05:03:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:28,022 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2021-01-07 05:03:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:03:28,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2021-01-07 05:03:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:28,025 INFO L225 Difference]: With dead ends: 90 [2021-01-07 05:03:28,025 INFO L226 Difference]: Without dead ends: 90 [2021-01-07 05:03:28,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:03:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-01-07 05:03:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 52. [2021-01-07 05:03:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-07 05:03:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2021-01-07 05:03:28,035 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 12 [2021-01-07 05:03:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:28,037 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-01-07 05:03:28,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:03:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2021-01-07 05:03:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:03:28,038 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:28,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:28,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:03:28,246 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:28,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:28,247 INFO L82 PathProgramCache]: Analyzing trace with hash 175763932, now seen corresponding path program 1 times [2021-01-07 05:03:28,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:28,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170095963] [2021-01-07 05:03:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:28,295 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:03:28,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170095963] [2021-01-07 05:03:28,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:28,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:03:28,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662603672] [2021-01-07 05:03:28,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:28,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:28,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:03:28,297 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 4 states. [2021-01-07 05:03:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:28,358 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2021-01-07 05:03:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:28,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-01-07 05:03:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:28,360 INFO L225 Difference]: With dead ends: 51 [2021-01-07 05:03:28,360 INFO L226 Difference]: Without dead ends: 51 [2021-01-07 05:03:28,361 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:03:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-07 05:03:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-01-07 05:03:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-07 05:03:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2021-01-07 05:03:28,368 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 13 [2021-01-07 05:03:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:28,369 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-01-07 05:03:28,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2021-01-07 05:03:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:03:28,370 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:28,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:28,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:03:28,373 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 175763933, now seen corresponding path program 1 times [2021-01-07 05:03:28,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:28,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908395024] [2021-01-07 05:03:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:28,435 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:03:28,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908395024] [2021-01-07 05:03:28,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:28,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:03:28,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328082931] [2021-01-07 05:03:28,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:03:28,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:03:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:03:28,438 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 6 states. [2021-01-07 05:03:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:28,503 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-01-07 05:03:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:03:28,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2021-01-07 05:03:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:28,504 INFO L225 Difference]: With dead ends: 55 [2021-01-07 05:03:28,504 INFO L226 Difference]: Without dead ends: 55 [2021-01-07 05:03:28,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:03:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-01-07 05:03:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2021-01-07 05:03:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-07 05:03:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2021-01-07 05:03:28,507 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 13 [2021-01-07 05:03:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:28,507 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-01-07 05:03:28,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:03:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2021-01-07 05:03:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:03:28,508 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:28,508 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:28,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:03:28,508 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1510420451, now seen corresponding path program 1 times [2021-01-07 05:03:28,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:28,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518982899] [2021-01-07 05:03:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:28,590 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:03:28,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518982899] [2021-01-07 05:03:28,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720945830] [2021-01-07 05:03:28,591 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:03:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:28,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 05:03:28,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:28,689 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:28,690 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:28,693 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:28,717 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:03:28,727 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:28,727 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:03:28,774 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:03:28,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:28,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-07 05:03:28,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75116794] [2021-01-07 05:03:28,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:03:28,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:03:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:03:28,776 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 8 states. [2021-01-07 05:03:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:28,907 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2021-01-07 05:03:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:03:28,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2021-01-07 05:03:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:28,908 INFO L225 Difference]: With dead ends: 73 [2021-01-07 05:03:28,908 INFO L226 Difference]: Without dead ends: 73 [2021-01-07 05:03:28,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:03:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-07 05:03:28,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2021-01-07 05:03:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2021-01-07 05:03:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2021-01-07 05:03:28,911 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 14 [2021-01-07 05:03:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:28,911 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2021-01-07 05:03:28,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:03:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2021-01-07 05:03:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:03:28,912 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:28,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:29,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 05:03:29,128 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:29,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash 618210419, now seen corresponding path program 1 times [2021-01-07 05:03:29,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:29,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772830014] [2021-01-07 05:03:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:29,165 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:03:29,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772830014] [2021-01-07 05:03:29,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:29,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:03:29,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763092291] [2021-01-07 05:03:29,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:03:29,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:03:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:03:29,168 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 5 states. [2021-01-07 05:03:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:29,215 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2021-01-07 05:03:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:03:29,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:03:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:29,216 INFO L225 Difference]: With dead ends: 48 [2021-01-07 05:03:29,216 INFO L226 Difference]: Without dead ends: 48 [2021-01-07 05:03:29,217 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:03:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-01-07 05:03:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-01-07 05:03:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-01-07 05:03:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2021-01-07 05:03:29,233 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 16 [2021-01-07 05:03:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:29,233 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2021-01-07 05:03:29,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:03:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2021-01-07 05:03:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:03:29,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:29,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:29,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:03:29,235 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash 618210420, now seen corresponding path program 1 times [2021-01-07 05:03:29,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:29,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029296548] [2021-01-07 05:03:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:29,299 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:03:29,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029296548] [2021-01-07 05:03:29,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:29,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:03:29,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222933347] [2021-01-07 05:03:29,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:03:29,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:03:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:03:29,302 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 7 states. [2021-01-07 05:03:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:29,384 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2021-01-07 05:03:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:03:29,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-01-07 05:03:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:29,386 INFO L225 Difference]: With dead ends: 54 [2021-01-07 05:03:29,386 INFO L226 Difference]: Without dead ends: 54 [2021-01-07 05:03:29,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:03:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-07 05:03:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2021-01-07 05:03:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:03:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2021-01-07 05:03:29,389 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 16 [2021-01-07 05:03:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:29,389 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2021-01-07 05:03:29,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:03:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2021-01-07 05:03:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:03:29,390 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:29,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:29,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:03:29,390 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:29,391 INFO L82 PathProgramCache]: Analyzing trace with hash 618212108, now seen corresponding path program 1 times [2021-01-07 05:03:29,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:29,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328959169] [2021-01-07 05:03:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:29,445 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:03:29,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328959169] [2021-01-07 05:03:29,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005519980] [2021-01-07 05:03:29,446 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:03:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:29,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-07 05:03:29,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:29,532 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:29,533 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:29,535 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:29,555 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2021-01-07 05:03:29,558 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:29,558 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:16, output treesize:9 [2021-01-07 05:03:29,613 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:03:29,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:29,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2021-01-07 05:03:29,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068203059] [2021-01-07 05:03:29,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:03:29,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:03:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:03:29,615 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 9 states. [2021-01-07 05:03:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:29,701 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2021-01-07 05:03:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:03:29,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2021-01-07 05:03:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:29,703 INFO L225 Difference]: With dead ends: 67 [2021-01-07 05:03:29,703 INFO L226 Difference]: Without dead ends: 67 [2021-01-07 05:03:29,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:03:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-07 05:03:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2021-01-07 05:03:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-07 05:03:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2021-01-07 05:03:29,705 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 16 [2021-01-07 05:03:29,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:29,706 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2021-01-07 05:03:29,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:03:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2021-01-07 05:03:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:03:29,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:29,707 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:03:29,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:29,921 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1984653866, now seen corresponding path program 1 times [2021-01-07 05:03:29,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:29,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906862072] [2021-01-07 05:03:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:29,947 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:03:29,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906862072] [2021-01-07 05:03:29,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:29,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:03:29,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417568782] [2021-01-07 05:03:29,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:29,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:03:29,949 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 4 states. [2021-01-07 05:03:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:29,988 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2021-01-07 05:03:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:29,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2021-01-07 05:03:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:29,990 INFO L225 Difference]: With dead ends: 52 [2021-01-07 05:03:29,990 INFO L226 Difference]: Without dead ends: 52 [2021-01-07 05:03:29,990 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:03:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-07 05:03:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-01-07 05:03:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-07 05:03:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2021-01-07 05:03:29,992 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 17 [2021-01-07 05:03:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:29,992 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-01-07 05:03:29,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2021-01-07 05:03:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:03:29,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:29,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:03:29,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:03:29,994 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1984653867, now seen corresponding path program 1 times [2021-01-07 05:03:29,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:29,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752409672] [2021-01-07 05:03:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:30,046 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:03:30,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752409672] [2021-01-07 05:03:30,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:30,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:03:30,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113711601] [2021-01-07 05:03:30,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:03:30,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:30,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:03:30,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:03:30,049 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 6 states. [2021-01-07 05:03:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:30,137 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2021-01-07 05:03:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:03:30,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-07 05:03:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:30,138 INFO L225 Difference]: With dead ends: 56 [2021-01-07 05:03:30,138 INFO L226 Difference]: Without dead ends: 56 [2021-01-07 05:03:30,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:03:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-01-07 05:03:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-01-07 05:03:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-07 05:03:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2021-01-07 05:03:30,141 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 17 [2021-01-07 05:03:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:30,142 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-01-07 05:03:30,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:03:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2021-01-07 05:03:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-07 05:03:30,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:30,142 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:30,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 05:03:30,143 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash 337162109, now seen corresponding path program 2 times [2021-01-07 05:03:30,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:30,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077030010] [2021-01-07 05:03:30,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:03:30,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077030010] [2021-01-07 05:03:30,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:30,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:03:30,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185470534] [2021-01-07 05:03:30,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:03:30,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:30,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:03:30,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:03:30,228 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 7 states. [2021-01-07 05:03:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:30,319 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-01-07 05:03:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:03:30,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2021-01-07 05:03:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:30,321 INFO L225 Difference]: With dead ends: 77 [2021-01-07 05:03:30,321 INFO L226 Difference]: Without dead ends: 77 [2021-01-07 05:03:30,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:03:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-07 05:03:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2021-01-07 05:03:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-07 05:03:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2021-01-07 05:03:30,324 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 19 [2021-01-07 05:03:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:30,324 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2021-01-07 05:03:30,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:03:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2021-01-07 05:03:30,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-07 05:03:30,325 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:30,325 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:30,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 05:03:30,326 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash -942701569, now seen corresponding path program 1 times [2021-01-07 05:03:30,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:30,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321342594] [2021-01-07 05:03:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:03:30,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321342594] [2021-01-07 05:03:30,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:30,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:03:30,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578042461] [2021-01-07 05:03:30,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:03:30,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:03:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:03:30,431 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 9 states. [2021-01-07 05:03:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:30,693 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-01-07 05:03:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:03:30,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2021-01-07 05:03:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:30,694 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:03:30,695 INFO L226 Difference]: Without dead ends: 91 [2021-01-07 05:03:30,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:03:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-01-07 05:03:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2021-01-07 05:03:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-07 05:03:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2021-01-07 05:03:30,698 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 19 [2021-01-07 05:03:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:30,699 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2021-01-07 05:03:30,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:03:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2021-01-07 05:03:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-07 05:03:30,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:30,700 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:30,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:03:30,700 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1963769923, now seen corresponding path program 1 times [2021-01-07 05:03:30,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:30,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634515023] [2021-01-07 05:03:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:03:30,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634515023] [2021-01-07 05:03:30,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:30,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:03:30,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614579967] [2021-01-07 05:03:30,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:03:30,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:03:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:03:30,910 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 9 states. [2021-01-07 05:03:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:31,023 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2021-01-07 05:03:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:03:31,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2021-01-07 05:03:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:31,025 INFO L225 Difference]: With dead ends: 82 [2021-01-07 05:03:31,025 INFO L226 Difference]: Without dead ends: 82 [2021-01-07 05:03:31,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:03:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-07 05:03:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2021-01-07 05:03:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-01-07 05:03:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2021-01-07 05:03:31,027 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 19 [2021-01-07 05:03:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:31,028 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2021-01-07 05:03:31,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:03:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2021-01-07 05:03:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:03:31,028 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:31,029 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:31,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 05:03:31,029 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash 303592444, now seen corresponding path program 1 times [2021-01-07 05:03:31,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:31,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419824978] [2021-01-07 05:03:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:31,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419824978] [2021-01-07 05:03:31,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:31,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:03:31,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780036620] [2021-01-07 05:03:31,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:03:31,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:31,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:03:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:03:31,143 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 8 states. [2021-01-07 05:03:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:31,290 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-01-07 05:03:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:03:31,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2021-01-07 05:03:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:31,292 INFO L225 Difference]: With dead ends: 100 [2021-01-07 05:03:31,292 INFO L226 Difference]: Without dead ends: 100 [2021-01-07 05:03:31,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:03:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-01-07 05:03:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-01-07 05:03:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:03:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2021-01-07 05:03:31,295 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 20 [2021-01-07 05:03:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:31,296 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2021-01-07 05:03:31,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:03:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2021-01-07 05:03:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:03:31,296 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:31,297 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:31,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 05:03:31,297 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:31,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1690552262, now seen corresponding path program 1 times [2021-01-07 05:03:31,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:31,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092574400] [2021-01-07 05:03:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:31,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092574400] [2021-01-07 05:03:31,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:31,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:03:31,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940486270] [2021-01-07 05:03:31,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:03:31,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:03:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:03:31,437 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 10 states. [2021-01-07 05:03:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:31,703 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2021-01-07 05:03:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:03:31,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2021-01-07 05:03:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:31,705 INFO L225 Difference]: With dead ends: 122 [2021-01-07 05:03:31,706 INFO L226 Difference]: Without dead ends: 122 [2021-01-07 05:03:31,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:03:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-01-07 05:03:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 91. [2021-01-07 05:03:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-07 05:03:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2021-01-07 05:03:31,710 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 20 [2021-01-07 05:03:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:31,710 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2021-01-07 05:03:31,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:03:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2021-01-07 05:03:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:03:31,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:31,711 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:31,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 05:03:31,711 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1016067132, now seen corresponding path program 1 times [2021-01-07 05:03:31,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:31,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277586716] [2021-01-07 05:03:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:31,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277586716] [2021-01-07 05:03:31,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:31,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:03:31,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410866420] [2021-01-07 05:03:31,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:03:31,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:03:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:03:31,886 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 9 states. [2021-01-07 05:03:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:32,059 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2021-01-07 05:03:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:03:32,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2021-01-07 05:03:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:32,061 INFO L225 Difference]: With dead ends: 135 [2021-01-07 05:03:32,061 INFO L226 Difference]: Without dead ends: 135 [2021-01-07 05:03:32,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:03:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-01-07 05:03:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 93. [2021-01-07 05:03:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:03:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2021-01-07 05:03:32,065 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 20 [2021-01-07 05:03:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:32,065 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2021-01-07 05:03:32,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:03:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2021-01-07 05:03:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:03:32,067 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:32,067 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] [2021-01-07 05:03:32,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:03:32,068 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash 821386545, now seen corresponding path program 1 times [2021-01-07 05:03:32,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:32,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609009659] [2021-01-07 05:03:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:32,134 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:03:32,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609009659] [2021-01-07 05:03:32,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:03:32,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:03:32,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288695373] [2021-01-07 05:03:32,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:32,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:32,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:32,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:03:32,136 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 4 states. [2021-01-07 05:03:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:32,159 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2021-01-07 05:03:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:32,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2021-01-07 05:03:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:32,161 INFO L225 Difference]: With dead ends: 92 [2021-01-07 05:03:32,162 INFO L226 Difference]: Without dead ends: 75 [2021-01-07 05:03:32,164 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:03:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-07 05:03:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-01-07 05:03:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-07 05:03:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2021-01-07 05:03:32,166 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 21 [2021-01-07 05:03:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:32,166 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2021-01-07 05:03:32,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2021-01-07 05:03:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:03:32,167 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:32,167 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:32,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 05:03:32,169 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:32,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:32,170 INFO L82 PathProgramCache]: Analyzing trace with hash 293432666, now seen corresponding path program 1 times [2021-01-07 05:03:32,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:32,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736650964] [2021-01-07 05:03:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:32,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736650964] [2021-01-07 05:03:32,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773361842] [2021-01-07 05:03:32,292 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:03:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:32,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 05:03:32,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:32,427 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:32,427 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:32,429 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:32,453 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:03:32,466 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:32,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:03:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:32,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:32,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-01-07 05:03:32,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423448868] [2021-01-07 05:03:32,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:03:32,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:32,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:03:32,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:03:32,610 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 16 states. [2021-01-07 05:03:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:33,030 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2021-01-07 05:03:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:03:33,031 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2021-01-07 05:03:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:33,032 INFO L225 Difference]: With dead ends: 115 [2021-01-07 05:03:33,032 INFO L226 Difference]: Without dead ends: 115 [2021-01-07 05:03:33,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:03:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-01-07 05:03:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2021-01-07 05:03:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-07 05:03:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2021-01-07 05:03:33,036 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 23 [2021-01-07 05:03:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:33,036 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2021-01-07 05:03:33,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:03:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2021-01-07 05:03:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:03:33,037 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:33,037 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:33,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:33,251 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash 506425757, now seen corresponding path program 1 times [2021-01-07 05:03:33,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:33,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700307823] [2021-01-07 05:03:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:33,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700307823] [2021-01-07 05:03:33,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710597072] [2021-01-07 05:03:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:33,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 05:03:33,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:33,479 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:33,480 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:33,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:33,504 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:03:33,510 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:33,510 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:03:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:33,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:33,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-01-07 05:03:33,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938656555] [2021-01-07 05:03:33,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:03:33,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:33,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:03:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:03:33,640 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand 16 states. [2021-01-07 05:03:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:34,048 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2021-01-07 05:03:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:03:34,048 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2021-01-07 05:03:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:34,049 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:03:34,049 INFO L226 Difference]: Without dead ends: 104 [2021-01-07 05:03:34,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:03:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-07 05:03:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2021-01-07 05:03:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:03:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2021-01-07 05:03:34,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 24 [2021-01-07 05:03:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:34,053 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2021-01-07 05:03:34,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:03:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2021-01-07 05:03:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:03:34,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:34,054 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:34,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-07 05:03:34,265 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:34,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1809160449, now seen corresponding path program 1 times [2021-01-07 05:03:34,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:34,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648216360] [2021-01-07 05:03:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:34,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648216360] [2021-01-07 05:03:34,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400875481] [2021-01-07 05:03:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:34,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 05:03:34,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:34,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:34,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-01-07 05:03:34,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364379313] [2021-01-07 05:03:34,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 05:03:34,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:34,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 05:03:34,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:03:34,614 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 15 states. [2021-01-07 05:03:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:34,929 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2021-01-07 05:03:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:03:34,930 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2021-01-07 05:03:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:34,930 INFO L225 Difference]: With dead ends: 104 [2021-01-07 05:03:34,930 INFO L226 Difference]: Without dead ends: 104 [2021-01-07 05:03:34,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:03:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-07 05:03:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2021-01-07 05:03:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:03:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2021-01-07 05:03:34,934 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 24 [2021-01-07 05:03:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:34,935 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2021-01-07 05:03:34,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 05:03:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2021-01-07 05:03:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:03:34,935 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:34,935 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] [2021-01-07 05:03:35,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:35,144 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash -249399040, now seen corresponding path program 1 times [2021-01-07 05:03:35,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:35,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822000739] [2021-01-07 05:03:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:35,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822000739] [2021-01-07 05:03:35,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864873605] [2021-01-07 05:03:35,269 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:03:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:35,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjunts are in the unsatisfiable core [2021-01-07 05:03:35,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:35,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:35,383 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:35,384 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:35,385 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:35,407 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:03:35,410 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:35,410 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:03:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:35,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:35,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-01-07 05:03:35,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326962237] [2021-01-07 05:03:35,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:03:35,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:03:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:03:35,597 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 16 states. [2021-01-07 05:03:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:36,078 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2021-01-07 05:03:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:03:36,078 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2021-01-07 05:03:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:36,079 INFO L225 Difference]: With dead ends: 109 [2021-01-07 05:03:36,079 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:03:36,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:03:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:03:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2021-01-07 05:03:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:03:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2021-01-07 05:03:36,082 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 25 [2021-01-07 05:03:36,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:36,082 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2021-01-07 05:03:36,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:03:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2021-01-07 05:03:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:03:36,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:36,083 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:36,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:36,284 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:36,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:36,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1394123375, now seen corresponding path program 2 times [2021-01-07 05:03:36,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:36,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050682840] [2021-01-07 05:03:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:03:36,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050682840] [2021-01-07 05:03:36,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018765241] [2021-01-07 05:03:36,627 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 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:03:36,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:03:36,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:36,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 05:03:36,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:36,828 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:03:36,829 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:36,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:36,837 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:36,838 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2021-01-07 05:03:36,998 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:03:36,999 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:37,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:37,001 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:37,001 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-01-07 05:03:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:03:37,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:37,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2021-01-07 05:03:37,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553298518] [2021-01-07 05:03:37,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-07 05:03:37,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-07 05:03:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:03:37,009 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 21 states. [2021-01-07 05:03:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:37,849 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2021-01-07 05:03:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:03:37,850 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2021-01-07 05:03:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:37,851 INFO L225 Difference]: With dead ends: 193 [2021-01-07 05:03:37,852 INFO L226 Difference]: Without dead ends: 177 [2021-01-07 05:03:37,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:03:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-01-07 05:03:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2021-01-07 05:03:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 05:03:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2021-01-07 05:03:37,858 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 26 [2021-01-07 05:03:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:37,858 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2021-01-07 05:03:37,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-07 05:03:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2021-01-07 05:03:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:03:37,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:37,859 INFO L422 BasicCegarLoop]: trace histogram [3, 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:38,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-07 05:03:38,075 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 446658823, now seen corresponding path program 2 times [2021-01-07 05:03:38,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:38,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58090003] [2021-01-07 05:03:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:38,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58090003] [2021-01-07 05:03:38,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270992221] [2021-01-07 05:03:38,397 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 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:03:38,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:03:38,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:38,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 60 conjunts are in the unsatisfiable core [2021-01-07 05:03:38,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:38,566 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:03:38,567 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:38,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:38,578 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:38,578 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2021-01-07 05:03:38,635 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:38,636 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 25 treesize of output 63 [2021-01-07 05:03:38,639 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:38,668 INFO L625 ElimStorePlain]: treesize reduction 35, result has 48.5 percent of original size [2021-01-07 05:03:38,671 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:38,671 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2021-01-07 05:03:39,064 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2021-01-07 05:03:39,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:39,340 INFO L348 Elim1Store]: treesize reduction 20, result has 80.4 percent of original size [2021-01-07 05:03:39,341 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 98 [2021-01-07 05:03:39,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:39,410 INFO L625 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2021-01-07 05:03:39,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:39,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:03:39,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:03:39,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:39,423 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:03:39,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:52 [2021-01-07 05:03:39,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:39,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:03:39,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:03:39,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:39,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:03:39,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:03:40,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2021-01-07 05:03:40,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:03:40,436 INFO L443 ElimStorePlain]: Different costs {7=[v_prenex_3], 15=[|#memory_int|]} [2021-01-07 05:03:40,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:03:40,444 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 36 treesize of output 14 [2021-01-07 05:03:40,446 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:40,486 INFO L625 ElimStorePlain]: treesize reduction 4, result has 94.1 percent of original size [2021-01-07 05:03:40,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:40,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:03:40,542 INFO L348 Elim1Store]: treesize reduction 12, result has 79.3 percent of original size [2021-01-07 05:03:40,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 62 [2021-01-07 05:03:40,547 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:03:40,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:03:40,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:03:40,549 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:03:40,553 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:40,593 INFO L625 ElimStorePlain]: treesize reduction 15, result has 68.8 percent of original size [2021-01-07 05:03:40,607 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:40,607 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:100, output treesize:3 [2021-01-07 05:03:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:40,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:40,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 27 [2021-01-07 05:03:40,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839863199] [2021-01-07 05:03:40,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:03:40,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:40,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:03:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=636, Unknown=1, NotChecked=0, Total=702 [2021-01-07 05:03:40,619 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 27 states. [2021-01-07 05:03:41,340 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2021-01-07 05:03:46,586 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2021-01-07 05:03:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:55,920 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2021-01-07 05:03:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-07 05:03:55,921 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2021-01-07 05:03:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:55,922 INFO L225 Difference]: With dead ends: 183 [2021-01-07 05:03:55,922 INFO L226 Difference]: Without dead ends: 168 [2021-01-07 05:03:55,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=329, Invalid=1920, Unknown=7, NotChecked=0, Total=2256 [2021-01-07 05:03:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-07 05:03:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2021-01-07 05:03:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-07 05:03:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2021-01-07 05:03:55,929 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 28 [2021-01-07 05:03:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:55,929 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2021-01-07 05:03:55,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:03:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2021-01-07 05:03:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:03:55,930 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:55,930 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:56,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:56,131 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2025170382, now seen corresponding path program 3 times [2021-01-07 05:03:56,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:56,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553997004] [2021-01-07 05:03:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:56,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553997004] [2021-01-07 05:03:56,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302079803] [2021-01-07 05:03:56,260 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 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:03:56,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-07 05:03:56,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:56,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2021-01-07 05:03:56,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:56,353 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:56,354 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:56,356 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:56,385 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:03:56,388 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:56,389 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:03:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:56,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:56,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-01-07 05:03:56,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16740564] [2021-01-07 05:03:56,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:03:56,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:03:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:03:56,606 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand 20 states. [2021-01-07 05:03:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:57,253 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2021-01-07 05:03:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:03:57,254 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2021-01-07 05:03:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:57,257 INFO L225 Difference]: With dead ends: 235 [2021-01-07 05:03:57,257 INFO L226 Difference]: Without dead ends: 235 [2021-01-07 05:03:57,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:03:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-01-07 05:03:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 163. [2021-01-07 05:03:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-07 05:03:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2021-01-07 05:03:57,266 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 30 [2021-01-07 05:03:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:57,266 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2021-01-07 05:03:57,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:03:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2021-01-07 05:03:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:03:57,267 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:57,267 INFO L422 BasicCegarLoop]: trace histogram [3, 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:57,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:57,483 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:57,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1644175301, now seen corresponding path program 2 times [2021-01-07 05:03:57,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:57,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894242093] [2021-01-07 05:03:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:57,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894242093] [2021-01-07 05:03:57,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398522955] [2021-01-07 05:03:57,635 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 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:03:57,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 05:03:57,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:57,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 05:03:57,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:03:57,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:03:57,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-01-07 05:03:57,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364883680] [2021-01-07 05:03:57,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:03:57,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:03:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:03:57,748 INFO L87 Difference]: Start difference. First operand 163 states and 189 transitions. Second operand 4 states. [2021-01-07 05:03:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:57,786 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2021-01-07 05:03:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:03:57,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 05:03:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:57,788 INFO L225 Difference]: With dead ends: 166 [2021-01-07 05:03:57,788 INFO L226 Difference]: Without dead ends: 163 [2021-01-07 05:03:57,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:03:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-07 05:03:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2021-01-07 05:03:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-01-07 05:03:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2021-01-07 05:03:57,793 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 31 [2021-01-07 05:03:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:57,793 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2021-01-07 05:03:57,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:03:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2021-01-07 05:03:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:03:57,794 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:57,794 INFO L422 BasicCegarLoop]: trace histogram [3, 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:58,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-01-07 05:03:58,007 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1580697398, now seen corresponding path program 3 times [2021-01-07 05:03:58,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:58,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741928317] [2021-01-07 05:03:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:58,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741928317] [2021-01-07 05:03:58,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898077405] [2021-01-07 05:03:58,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:03:58,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:03:58,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:03:58,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-07 05:03:58,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:58,232 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_27|]} [2021-01-07 05:03:58,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:03:58,237 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:58,238 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:58,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:58,251 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:58,253 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:58,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:58,262 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:58,262 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2021-01-07 05:03:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:58,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:58,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2021-01-07 05:03:58,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059704387] [2021-01-07 05:03:58,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:03:58,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:03:58,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:03:58,489 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand 19 states. [2021-01-07 05:03:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:03:59,031 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2021-01-07 05:03:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:03:59,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2021-01-07 05:03:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:03:59,033 INFO L225 Difference]: With dead ends: 168 [2021-01-07 05:03:59,033 INFO L226 Difference]: Without dead ends: 168 [2021-01-07 05:03:59,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:03:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-07 05:03:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2021-01-07 05:03:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2021-01-07 05:03:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2021-01-07 05:03:59,039 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 32 [2021-01-07 05:03:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:03:59,039 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2021-01-07 05:03:59,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:03:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2021-01-07 05:03:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:03:59,040 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:03:59,040 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:03:59,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-01-07 05:03:59,254 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:03:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:03:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash 608149782, now seen corresponding path program 1 times [2021-01-07 05:03:59,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:03:59,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487707322] [2021-01-07 05:03:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:03:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:59,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487707322] [2021-01-07 05:03:59,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52751324] [2021-01-07 05:03:59,412 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 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:03:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:03:59,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:03:59,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:03:59,493 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:03:59,493 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:03:59,494 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:03:59,517 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:03:59,519 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:03:59,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:03:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:03:59,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:03:59,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-01-07 05:03:59,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045454720] [2021-01-07 05:03:59,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:03:59,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:03:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:03:59,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:03:59,719 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 20 states. [2021-01-07 05:04:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:00,556 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2021-01-07 05:04:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:04:00,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2021-01-07 05:04:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:00,558 INFO L225 Difference]: With dead ends: 206 [2021-01-07 05:04:00,558 INFO L226 Difference]: Without dead ends: 191 [2021-01-07 05:04:00,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:04:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-07 05:04:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2021-01-07 05:04:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2021-01-07 05:04:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2021-01-07 05:04:00,565 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 32 [2021-01-07 05:04:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:00,565 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2021-01-07 05:04:00,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:04:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2021-01-07 05:04:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:04:00,566 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:00,566 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:00,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-07 05:04:00,780 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -445225321, now seen corresponding path program 4 times [2021-01-07 05:04:00,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:00,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568134826] [2021-01-07 05:04:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:04:00,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568134826] [2021-01-07 05:04:00,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200185715] [2021-01-07 05:04:00,943 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 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:04:00,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:04:00,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:00,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:04:00,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:01,134 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:04:01,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:01,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:01,146 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:01,146 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2021-01-07 05:04:01,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:01,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:01,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:01,625 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:01,626 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 52 [2021-01-07 05:04:01,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:04:01,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:04:01,633 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:01,668 INFO L625 ElimStorePlain]: treesize reduction 9, result has 79.1 percent of original size [2021-01-07 05:04:01,676 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:01,676 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:3 [2021-01-07 05:04:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:04:01,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:01,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 27 [2021-01-07 05:04:01,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732489783] [2021-01-07 05:04:01,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:04:01,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:04:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:04:01,685 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand 27 states. [2021-01-07 05:04:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:04,006 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2021-01-07 05:04:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-07 05:04:04,009 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2021-01-07 05:04:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:04,012 INFO L225 Difference]: With dead ends: 302 [2021-01-07 05:04:04,012 INFO L226 Difference]: Without dead ends: 291 [2021-01-07 05:04:04,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=579, Invalid=2843, Unknown=0, NotChecked=0, Total=3422 [2021-01-07 05:04:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-07 05:04:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 196. [2021-01-07 05:04:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2021-01-07 05:04:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2021-01-07 05:04:04,019 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 33 [2021-01-07 05:04:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:04,019 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2021-01-07 05:04:04,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:04:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2021-01-07 05:04:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:04:04,020 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:04,021 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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:04,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:04,233 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1756979051, now seen corresponding path program 2 times [2021-01-07 05:04:04,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:04,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158015386] [2021-01-07 05:04:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:04,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158015386] [2021-01-07 05:04:04,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707511297] [2021-01-07 05:04:04,390 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:04:04,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:04:04,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:04,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-07 05:04:04,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:04,490 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:04,491 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:04:04,495 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:04,522 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:04:04,527 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:04,528 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:04:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:04,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:04,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-01-07 05:04:04,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995361747] [2021-01-07 05:04:04,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:04:04,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:04:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:04:04,772 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand 19 states. [2021-01-07 05:04:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:05,540 INFO L93 Difference]: Finished difference Result 218 states and 240 transitions. [2021-01-07 05:04:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:04:05,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2021-01-07 05:04:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:05,543 INFO L225 Difference]: With dead ends: 218 [2021-01-07 05:04:05,543 INFO L226 Difference]: Without dead ends: 218 [2021-01-07 05:04:05,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:04:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-01-07 05:04:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2021-01-07 05:04:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-01-07 05:04:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2021-01-07 05:04:05,549 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 33 [2021-01-07 05:04:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:05,549 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2021-01-07 05:04:05,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:04:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2021-01-07 05:04:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:04:05,550 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:05,550 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:05,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:05,764 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash 603565394, now seen corresponding path program 4 times [2021-01-07 05:04:05,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:05,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797317581] [2021-01-07 05:04:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:06,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797317581] [2021-01-07 05:04:06,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640289298] [2021-01-07 05:04:06,115 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 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:04:06,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:04:06,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:06,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 52 conjunts are in the unsatisfiable core [2021-01-07 05:04:06,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:06,210 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_28|]} [2021-01-07 05:04:06,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:06,215 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:06,216 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:06,230 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:06,232 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:06,241 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:04:06,242 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-01-07 05:04:06,385 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:04:06,386 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,393 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:06,394 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,394 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-01-07 05:04:06,439 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 26 treesize of output 25 [2021-01-07 05:04:06,440 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:06,450 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:06,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2021-01-07 05:04:06,739 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:06,739 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2021-01-07 05:04:06,742 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,776 INFO L625 ElimStorePlain]: treesize reduction 19, result has 72.1 percent of original size [2021-01-07 05:04:06,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:24 [2021-01-07 05:04:06,886 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:04:06,887 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:06,899 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:06,900 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-01-07 05:04:07,014 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-01-07 05:04:07,023 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:07,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:07,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:04:07,045 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:07,052 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-01-07 05:04:07,054 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:07,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:07,063 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:07,064 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2021-01-07 05:04:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:07,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:07,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-01-07 05:04:07,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915050367] [2021-01-07 05:04:07,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:04:07,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:07,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:04:07,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:04:07,078 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand 30 states. [2021-01-07 05:04:08,462 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-01-07 05:04:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:10,303 INFO L93 Difference]: Finished difference Result 304 states and 338 transitions. [2021-01-07 05:04:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-07 05:04:10,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2021-01-07 05:04:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:10,306 INFO L225 Difference]: With dead ends: 304 [2021-01-07 05:04:10,306 INFO L226 Difference]: Without dead ends: 285 [2021-01-07 05:04:10,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=376, Invalid=2816, Unknown=0, NotChecked=0, Total=3192 [2021-01-07 05:04:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-01-07 05:04:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 266. [2021-01-07 05:04:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-07 05:04:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 301 transitions. [2021-01-07 05:04:10,321 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 301 transitions. Word has length 36 [2021-01-07 05:04:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:10,322 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 301 transitions. [2021-01-07 05:04:10,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:04:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 301 transitions. [2021-01-07 05:04:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:04:10,323 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:10,323 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:10,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:10,538 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -541196940, now seen corresponding path program 5 times [2021-01-07 05:04:10,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:10,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415743497] [2021-01-07 05:04:10,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:10,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415743497] [2021-01-07 05:04:10,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118910339] [2021-01-07 05:04:10,759 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 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:04:10,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-01-07 05:04:10,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:10,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 38 conjunts are in the unsatisfiable core [2021-01-07 05:04:10,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:10,885 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:10,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, 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:10,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:10,916 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:04:10,919 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:10,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:04:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:11,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:11,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2021-01-07 05:04:11,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641032239] [2021-01-07 05:04:11,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:04:11,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:11,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:04:11,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:04:11,154 INFO L87 Difference]: Start difference. First operand 266 states and 301 transitions. Second operand 20 states. [2021-01-07 05:04:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:11,821 INFO L93 Difference]: Finished difference Result 445 states and 490 transitions. [2021-01-07 05:04:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:04:11,821 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2021-01-07 05:04:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:11,824 INFO L225 Difference]: With dead ends: 445 [2021-01-07 05:04:11,824 INFO L226 Difference]: Without dead ends: 445 [2021-01-07 05:04:11,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:04:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-01-07 05:04:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 278. [2021-01-07 05:04:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2021-01-07 05:04:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 316 transitions. [2021-01-07 05:04:11,835 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 316 transitions. Word has length 37 [2021-01-07 05:04:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:11,835 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 316 transitions. [2021-01-07 05:04:11,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:04:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 316 transitions. [2021-01-07 05:04:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:04:11,837 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:11,837 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2021-01-07 05:04:12,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-01-07 05:04:12,050 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -916383204, now seen corresponding path program 2 times [2021-01-07 05:04:12,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:12,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81497259] [2021-01-07 05:04:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:12,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81497259] [2021-01-07 05:04:12,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228809737] [2021-01-07 05:04:12,260 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 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:04:12,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:04:12,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:12,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 38 conjunts are in the unsatisfiable core [2021-01-07 05:04:12,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:12,395 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:12,396 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:12,397 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:12,424 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:04:12,428 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:12,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:04:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:04:12,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:12,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2021-01-07 05:04:12,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881740952] [2021-01-07 05:04:12,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-07 05:04:12,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-07 05:04:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:04:12,753 INFO L87 Difference]: Start difference. First operand 278 states and 316 transitions. Second operand 24 states. [2021-01-07 05:04:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:15,217 INFO L93 Difference]: Finished difference Result 383 states and 418 transitions. [2021-01-07 05:04:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-07 05:04:15,220 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2021-01-07 05:04:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:15,222 INFO L225 Difference]: With dead ends: 383 [2021-01-07 05:04:15,222 INFO L226 Difference]: Without dead ends: 342 [2021-01-07 05:04:15,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=387, Invalid=2063, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:04:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-07 05:04:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 271. [2021-01-07 05:04:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2021-01-07 05:04:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2021-01-07 05:04:15,237 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 39 [2021-01-07 05:04:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:15,237 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2021-01-07 05:04:15,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-07 05:04:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2021-01-07 05:04:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:04:15,238 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:15,238 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:15,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-01-07 05:04:15,452 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:15,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:15,453 INFO L82 PathProgramCache]: Analyzing trace with hash 509207573, now seen corresponding path program 6 times [2021-01-07 05:04:15,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:15,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142982472] [2021-01-07 05:04:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:04:15,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142982472] [2021-01-07 05:04:15,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518827721] [2021-01-07 05:04:15,618 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 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:04:15,700 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-01-07 05:04:15,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:15,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-07 05:04:15,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:15,828 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:04:15,829 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:15,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:15,836 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:15,837 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:04:15,939 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 05:04:15,940 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:15,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:15,942 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:15,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 05:04:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:04:15,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:15,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2021-01-07 05:04:15,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975595594] [2021-01-07 05:04:15,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:04:15,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:15,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:04:15,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:04:15,953 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand 23 states. [2021-01-07 05:04:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:16,710 INFO L93 Difference]: Finished difference Result 526 states and 572 transitions. [2021-01-07 05:04:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:04:16,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2021-01-07 05:04:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:16,714 INFO L225 Difference]: With dead ends: 526 [2021-01-07 05:04:16,714 INFO L226 Difference]: Without dead ends: 512 [2021-01-07 05:04:16,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:04:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-01-07 05:04:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 329. [2021-01-07 05:04:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2021-01-07 05:04:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 370 transitions. [2021-01-07 05:04:16,731 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 370 transitions. Word has length 40 [2021-01-07 05:04:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:16,731 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 370 transitions. [2021-01-07 05:04:16,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:04:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 370 transitions. [2021-01-07 05:04:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:04:16,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:16,732 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:16,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-01-07 05:04:16,947 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash 500447765, now seen corresponding path program 5 times [2021-01-07 05:04:16,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:16,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763182107] [2021-01-07 05:04:16,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:17,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763182107] [2021-01-07 05:04:17,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693191576] [2021-01-07 05:04:17,154 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 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:04:17,236 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-01-07 05:04:17,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:17,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 65 conjunts are in the unsatisfiable core [2021-01-07 05:04:17,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:17,251 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_29|]} [2021-01-07 05:04:17,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:17,256 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:17,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:17,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:17,276 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:17,277 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:17,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:17,286 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:04:17,286 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-01-07 05:04:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:17,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:17,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2021-01-07 05:04:17,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952296530] [2021-01-07 05:04:17,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-07 05:04:17,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-07 05:04:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:04:17,578 INFO L87 Difference]: Start difference. First operand 329 states and 370 transitions. Second operand 22 states. [2021-01-07 05:04:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:18,354 INFO L93 Difference]: Finished difference Result 351 states and 385 transitions. [2021-01-07 05:04:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:04:18,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2021-01-07 05:04:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:18,356 INFO L225 Difference]: With dead ends: 351 [2021-01-07 05:04:18,357 INFO L226 Difference]: Without dead ends: 351 [2021-01-07 05:04:18,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:04:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-01-07 05:04:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 334. [2021-01-07 05:04:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2021-01-07 05:04:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 375 transitions. [2021-01-07 05:04:18,366 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 375 transitions. Word has length 40 [2021-01-07 05:04:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:18,366 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 375 transitions. [2021-01-07 05:04:18,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-07 05:04:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 375 transitions. [2021-01-07 05:04:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:04:18,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:18,367 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:18,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-01-07 05:04:18,582 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1665988438, now seen corresponding path program 3 times [2021-01-07 05:04:18,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:18,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423223240] [2021-01-07 05:04:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:18,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423223240] [2021-01-07 05:04:18,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020959646] [2021-01-07 05:04:18,766 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 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:04:18,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-07 05:04:18,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:18,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 05:04:18,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:18,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:18,895 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:18,896 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:04:18,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:18,925 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:04:18,928 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:18,928 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:04:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:19,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:19,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-01-07 05:04:19,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615908226] [2021-01-07 05:04:19,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:04:19,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:04:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:04:19,234 INFO L87 Difference]: Start difference. First operand 334 states and 375 transitions. Second operand 23 states. [2021-01-07 05:04:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:20,492 INFO L93 Difference]: Finished difference Result 370 states and 406 transitions. [2021-01-07 05:04:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:04:20,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2021-01-07 05:04:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:20,497 INFO L225 Difference]: With dead ends: 370 [2021-01-07 05:04:20,497 INFO L226 Difference]: Without dead ends: 370 [2021-01-07 05:04:20,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:04:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-07 05:04:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 336. [2021-01-07 05:04:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2021-01-07 05:04:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 377 transitions. [2021-01-07 05:04:20,506 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 377 transitions. Word has length 41 [2021-01-07 05:04:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:20,506 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 377 transitions. [2021-01-07 05:04:20,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:04:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 377 transitions. [2021-01-07 05:04:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:04:20,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:20,507 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:20,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-01-07 05:04:20,722 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -203339112, now seen corresponding path program 7 times [2021-01-07 05:04:20,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:20,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708508792] [2021-01-07 05:04:20,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:20,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708508792] [2021-01-07 05:04:20,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398281633] [2021-01-07 05:04:20,942 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 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:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:21,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 05:04:21,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:21,029 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:21,029 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:21,034 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:21,070 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:04:21,074 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:21,074 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:04:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 15 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:21,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:21,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2021-01-07 05:04:21,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900440975] [2021-01-07 05:04:21,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:04:21,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:21,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:04:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:04:21,466 INFO L87 Difference]: Start difference. First operand 336 states and 377 transitions. Second operand 27 states. [2021-01-07 05:04:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:22,684 INFO L93 Difference]: Finished difference Result 598 states and 652 transitions. [2021-01-07 05:04:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:04:22,685 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2021-01-07 05:04:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:22,689 INFO L225 Difference]: With dead ends: 598 [2021-01-07 05:04:22,689 INFO L226 Difference]: Without dead ends: 598 [2021-01-07 05:04:22,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=268, Invalid=1214, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:04:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-01-07 05:04:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 348. [2021-01-07 05:04:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2021-01-07 05:04:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 392 transitions. [2021-01-07 05:04:22,699 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 392 transitions. Word has length 44 [2021-01-07 05:04:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:22,700 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 392 transitions. [2021-01-07 05:04:22,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:04:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 392 transitions. [2021-01-07 05:04:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:04:22,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:22,701 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:22,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:22,916 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1180553501, now seen corresponding path program 6 times [2021-01-07 05:04:22,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:22,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331882673] [2021-01-07 05:04:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:23,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331882673] [2021-01-07 05:04:23,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896858448] [2021-01-07 05:04:23,428 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:23,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-01-07 05:04:23,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:23,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 101 conjunts are in the unsatisfiable core [2021-01-07 05:04:23,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:23,559 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_30|]} [2021-01-07 05:04:23,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:23,564 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:23,565 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:23,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:23,582 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:23,583 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:23,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:23,593 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:04:23,594 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:19 [2021-01-07 05:04:23,874 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-01-07 05:04:23,874 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:23,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:23,888 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:23,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2021-01-07 05:04:23,959 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 27 treesize of output 26 [2021-01-07 05:04:23,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:23,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:23,977 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:23,978 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2021-01-07 05:04:24,251 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:24,251 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 56 [2021-01-07 05:04:24,253 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:24,300 INFO L625 ElimStorePlain]: treesize reduction 14, result has 78.8 percent of original size [2021-01-07 05:04:24,303 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:24,303 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2021-01-07 05:04:24,451 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:04:24,453 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:24,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:24,475 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:04:24,475 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2021-01-07 05:04:24,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 23 treesize of output 22 [2021-01-07 05:04:24,612 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:24,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:24,633 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:24,633 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2021-01-07 05:04:24,736 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 22 treesize of output 16 [2021-01-07 05:04:24,738 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:24,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:24,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:04:24,752 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:24,752 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-01-07 05:04:24,753 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:24,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:24,760 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:24,760 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2021-01-07 05:04:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:24,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:24,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2021-01-07 05:04:24,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861736560] [2021-01-07 05:04:24,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-01-07 05:04:24,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-01-07 05:04:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-01-07 05:04:24,777 INFO L87 Difference]: Start difference. First operand 348 states and 392 transitions. Second operand 37 states. [2021-01-07 05:04:25,626 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2021-01-07 05:04:25,954 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-01-07 05:04:26,276 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-01-07 05:04:26,644 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2021-01-07 05:04:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:28,593 INFO L93 Difference]: Finished difference Result 508 states and 564 transitions. [2021-01-07 05:04:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-07 05:04:28,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2021-01-07 05:04:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:28,596 INFO L225 Difference]: With dead ends: 508 [2021-01-07 05:04:28,596 INFO L226 Difference]: Without dead ends: 484 [2021-01-07 05:04:28,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=394, Invalid=3146, Unknown=0, NotChecked=0, Total=3540 [2021-01-07 05:04:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-01-07 05:04:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 444. [2021-01-07 05:04:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2021-01-07 05:04:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 503 transitions. [2021-01-07 05:04:28,609 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 503 transitions. Word has length 44 [2021-01-07 05:04:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:28,609 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 503 transitions. [2021-01-07 05:04:28,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2021-01-07 05:04:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 503 transitions. [2021-01-07 05:04:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:04:28,610 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:28,610 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:28,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-01-07 05:04:28,825 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:28,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1942078596, now seen corresponding path program 3 times [2021-01-07 05:04:28,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:28,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034054193] [2021-01-07 05:04:28,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:29,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034054193] [2021-01-07 05:04:29,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204846162] [2021-01-07 05:04:29,059 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 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:29,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-07 05:04:29,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:29,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-07 05:04:29,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:29,185 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:29,185 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:29,186 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:29,216 INFO L625 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2021-01-07 05:04:29,218 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:29,218 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2021-01-07 05:04:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:29,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:29,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2021-01-07 05:04:29,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643186018] [2021-01-07 05:04:29,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-07 05:04:29,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-07 05:04:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:04:29,830 INFO L87 Difference]: Start difference. First operand 444 states and 503 transitions. Second operand 29 states. [2021-01-07 05:04:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:33,621 INFO L93 Difference]: Finished difference Result 671 states and 729 transitions. [2021-01-07 05:04:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-07 05:04:33,622 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2021-01-07 05:04:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:33,625 INFO L225 Difference]: With dead ends: 671 [2021-01-07 05:04:33,625 INFO L226 Difference]: Without dead ends: 627 [2021-01-07 05:04:33,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=538, Invalid=2654, Unknown=0, NotChecked=0, Total=3192 [2021-01-07 05:04:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-01-07 05:04:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 424. [2021-01-07 05:04:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2021-01-07 05:04:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 475 transitions. [2021-01-07 05:04:33,638 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 475 transitions. Word has length 46 [2021-01-07 05:04:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:33,638 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 475 transitions. [2021-01-07 05:04:33,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-07 05:04:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 475 transitions. [2021-01-07 05:04:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:04:33,639 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:33,639 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:04:33,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:33,854 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1771580303, now seen corresponding path program 8 times [2021-01-07 05:04:33,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:33,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964977415] [2021-01-07 05:04:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:04:34,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964977415] [2021-01-07 05:04:34,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328697864] [2021-01-07 05:04:34,076 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 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:34,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:04:34,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:34,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 05:04:34,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:34,349 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:04:34,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:34,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:34,359 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:34,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2021-01-07 05:04:34,589 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 05:04:34,590 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:34,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:34,592 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:04:34,592 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-01-07 05:04:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:04:34,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:34,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2021-01-07 05:04:34,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437003624] [2021-01-07 05:04:34,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:04:34,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:04:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:04:34,605 INFO L87 Difference]: Start difference. First operand 424 states and 475 transitions. Second operand 31 states. [2021-01-07 05:04:36,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:04:36,004 INFO L93 Difference]: Finished difference Result 914 states and 989 transitions. [2021-01-07 05:04:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:04:36,004 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2021-01-07 05:04:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:04:36,008 INFO L225 Difference]: With dead ends: 914 [2021-01-07 05:04:36,008 INFO L226 Difference]: Without dead ends: 897 [2021-01-07 05:04:36,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:04:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-01-07 05:04:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 512. [2021-01-07 05:04:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2021-01-07 05:04:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 574 transitions. [2021-01-07 05:04:36,021 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 574 transitions. Word has length 47 [2021-01-07 05:04:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:04:36,021 INFO L481 AbstractCegarLoop]: Abstraction has 512 states and 574 transitions. [2021-01-07 05:04:36,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:04:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 574 transitions. [2021-01-07 05:04:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:04:36,022 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:04:36,023 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-07 05:04:36,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-01-07 05:04:36,238 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:04:36,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:04:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash 995519473, now seen corresponding path program 4 times [2021-01-07 05:04:36,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:04:36,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894674273] [2021-01-07 05:04:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:04:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:04:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:04:36,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894674273] [2021-01-07 05:04:36,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491193201] [2021-01-07 05:04:36,491 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:04:36,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:04:36,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:04:36,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 70 conjunts are in the unsatisfiable core [2021-01-07 05:04:36,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:04:36,589 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_31|]} [2021-01-07 05:04:36,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:36,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:36,595 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:04:36,596 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:36,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:36,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:04:36,611 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:04:36,612 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:36,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:36,622 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:36,622 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2021-01-07 05:04:36,677 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:04:36,678 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:04:36,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:36,687 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:04:36,688 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-01-07 05:04:36,806 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:36,806 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 18 treesize of output 18 [2021-01-07 05:04:36,808 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:04:36,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:04:36,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:04:36,826 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:04:36,828 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:04:36,829 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:44 [2021-01-07 05:04:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:04:37,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:04:37,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-01-07 05:04:37,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521668390] [2021-01-07 05:04:37,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:04:37,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:04:37,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:04:37,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=648, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:04:37,359 INFO L87 Difference]: Start difference. First operand 512 states and 574 transitions. Second operand 27 states. [2021-01-07 05:05:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:04,053 INFO L93 Difference]: Finished difference Result 723 states and 783 transitions. [2021-01-07 05:05:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-01-07 05:05:04,054 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2021-01-07 05:05:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:04,057 INFO L225 Difference]: With dead ends: 723 [2021-01-07 05:05:04,058 INFO L226 Difference]: Without dead ends: 671 [2021-01-07 05:05:04,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=879, Invalid=6234, Unknown=27, NotChecked=0, Total=7140 [2021-01-07 05:05:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-01-07 05:05:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 515. [2021-01-07 05:05:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2021-01-07 05:05:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 577 transitions. [2021-01-07 05:05:04,071 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 577 transitions. Word has length 47 [2021-01-07 05:05:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:04,071 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 577 transitions. [2021-01-07 05:05:04,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:05:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 577 transitions. [2021-01-07 05:05:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 05:05:04,072 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:04,073 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:04,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:04,285 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash 588049120, now seen corresponding path program 7 times [2021-01-07 05:05:04,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:04,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249910195] [2021-01-07 05:05:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:04,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249910195] [2021-01-07 05:05:04,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016809704] [2021-01-07 05:05:04,546 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:04,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-07 05:05:04,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:04,649 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_37|], 1=[|v_#valid_32|]} [2021-01-07 05:05:04,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:04,654 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:05:04,655 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:04,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:04,671 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:05:04,673 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:04,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:04,684 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:05:04,684 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2021-01-07 05:05:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:05,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:05,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2021-01-07 05:05:05,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901055753] [2021-01-07 05:05:05,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:05:05,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:05:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:05:05,131 INFO L87 Difference]: Start difference. First operand 515 states and 577 transitions. Second operand 27 states. [2021-01-07 05:05:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:06,341 INFO L93 Difference]: Finished difference Result 558 states and 611 transitions. [2021-01-07 05:05:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:05:06,342 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2021-01-07 05:05:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:06,344 INFO L225 Difference]: With dead ends: 558 [2021-01-07 05:05:06,344 INFO L226 Difference]: Without dead ends: 558 [2021-01-07 05:05:06,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:05:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-01-07 05:05:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 520. [2021-01-07 05:05:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2021-01-07 05:05:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 582 transitions. [2021-01-07 05:05:06,356 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 582 transitions. Word has length 48 [2021-01-07 05:05:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:06,356 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 582 transitions. [2021-01-07 05:05:06,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:05:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 582 transitions. [2021-01-07 05:05:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:05:06,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:06,357 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:06,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-01-07 05:05:06,572 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:06,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:06,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1049653567, now seen corresponding path program 4 times [2021-01-07 05:05:06,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:06,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001854756] [2021-01-07 05:05:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:06,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001854756] [2021-01-07 05:05:06,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421314024] [2021-01-07 05:05:06,814 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:06,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:05:06,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:05:06,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 66 conjunts are in the unsatisfiable core [2021-01-07 05:05:06,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:06,903 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_33|]} [2021-01-07 05:05:06,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:06,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:06,909 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:05:06,910 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:06,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:06,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:06,928 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:05:06,929 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:06,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:06,941 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:05:06,941 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-01-07 05:05:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:07,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:07,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-01-07 05:05:07,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643602077] [2021-01-07 05:05:07,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:05:07,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:07,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:05:07,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:05:07,604 INFO L87 Difference]: Start difference. First operand 520 states and 582 transitions. Second operand 27 states. [2021-01-07 05:05:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:10,039 INFO L93 Difference]: Finished difference Result 583 states and 639 transitions. [2021-01-07 05:05:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:05:10,040 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 49 [2021-01-07 05:05:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:10,044 INFO L225 Difference]: With dead ends: 583 [2021-01-07 05:05:10,044 INFO L226 Difference]: Without dead ends: 583 [2021-01-07 05:05:10,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:05:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-01-07 05:05:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 522. [2021-01-07 05:05:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2021-01-07 05:05:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 584 transitions. [2021-01-07 05:05:10,054 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 584 transitions. Word has length 49 [2021-01-07 05:05:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:10,055 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 584 transitions. [2021-01-07 05:05:10,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:05:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 584 transitions. [2021-01-07 05:05:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 05:05:10,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:10,056 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:10,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:10,268 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:10,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1424251762, now seen corresponding path program 9 times [2021-01-07 05:05:10,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:10,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157280757] [2021-01-07 05:05:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:10,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157280757] [2021-01-07 05:05:10,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166752424] [2021-01-07 05:05:10,537 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:10,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-01-07 05:05:10,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:05:10,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 05:05:10,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:10,652 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:10,652 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:05:10,654 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:10,686 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:05:10,689 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:05:10,690 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:05:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:11,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:11,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2021-01-07 05:05:11,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809849626] [2021-01-07 05:05:11,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-07 05:05:11,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:11,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-07 05:05:11,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2021-01-07 05:05:11,284 INFO L87 Difference]: Start difference. First operand 522 states and 584 transitions. Second operand 32 states. [2021-01-07 05:05:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:13,247 INFO L93 Difference]: Finished difference Result 969 states and 1053 transitions. [2021-01-07 05:05:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:05:13,248 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2021-01-07 05:05:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:13,251 INFO L225 Difference]: With dead ends: 969 [2021-01-07 05:05:13,252 INFO L226 Difference]: Without dead ends: 969 [2021-01-07 05:05:13,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=392, Invalid=1678, Unknown=0, NotChecked=0, Total=2070 [2021-01-07 05:05:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2021-01-07 05:05:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 537. [2021-01-07 05:05:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2021-01-07 05:05:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 603 transitions. [2021-01-07 05:05:13,264 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 603 transitions. Word has length 51 [2021-01-07 05:05:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:13,265 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 603 transitions. [2021-01-07 05:05:13,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-07 05:05:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 603 transitions. [2021-01-07 05:05:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 05:05:13,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:13,266 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:13,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-01-07 05:05:13,481 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1427430296, now seen corresponding path program 8 times [2021-01-07 05:05:13,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:13,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890179014] [2021-01-07 05:05:13,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:14,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890179014] [2021-01-07 05:05:14,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684674553] [2021-01-07 05:05:14,152 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:14,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:05:14,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:05:14,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 105 conjunts are in the unsatisfiable core [2021-01-07 05:05:14,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:14,583 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:05:14,584 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:14,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:14,596 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:05:14,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2021-01-07 05:05:14,693 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:14,694 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 25 treesize of output 63 [2021-01-07 05:05:14,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:14,733 INFO L625 ElimStorePlain]: treesize reduction 35, result has 48.5 percent of original size [2021-01-07 05:05:14,735 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:05:14,736 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2021-01-07 05:05:15,259 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2021-01-07 05:05:15,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:15,561 INFO L348 Elim1Store]: treesize reduction 20, result has 80.4 percent of original size [2021-01-07 05:05:15,561 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 98 [2021-01-07 05:05:15,565 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:15,623 INFO L625 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2021-01-07 05:05:15,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:15,626 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:05:15,626 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:52 [2021-01-07 05:05:15,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:15,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:16,133 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2021-01-07 05:05:16,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:16,143 INFO L443 ElimStorePlain]: Different costs {11=[v_prenex_8], 19=[|v_#memory_int_33|]} [2021-01-07 05:05:16,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:16,160 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:16,161 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 57 [2021-01-07 05:05:16,163 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:16,251 INFO L625 ElimStorePlain]: treesize reduction 12, result has 90.2 percent of original size [2021-01-07 05:05:16,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:16,427 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2021-01-07 05:05:16,428 INFO L348 Elim1Store]: treesize reduction 32, result has 79.9 percent of original size [2021-01-07 05:05:16,428 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 147 [2021-01-07 05:05:16,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:05:16,432 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:05:16,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:05:16,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:05:16,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:16,438 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:16,603 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-01-07 05:05:16,606 INFO L625 ElimStorePlain]: treesize reduction 87, result has 61.0 percent of original size [2021-01-07 05:05:16,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:16,614 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-01-07 05:05:16,615 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:110, output treesize:125 [2021-01-07 05:05:16,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:16,942 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2021-01-07 05:05:16,943 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:16,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:16,970 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:05:16,971 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:31 [2021-01-07 05:05:17,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:17,207 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2021-01-07 05:05:17,209 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:17,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:17,227 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:05:17,227 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:27 [2021-01-07 05:05:17,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:17,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:05:17,428 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:17,429 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 14 [2021-01-07 05:05:17,431 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:17,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:17,439 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:05:17,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2021-01-07 05:05:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:17,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:17,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2021-01-07 05:05:17,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576140392] [2021-01-07 05:05:17,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-01-07 05:05:17,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-01-07 05:05:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=2137, Unknown=0, NotChecked=0, Total=2256 [2021-01-07 05:05:17,469 INFO L87 Difference]: Start difference. First operand 537 states and 603 transitions. Second operand 48 states. [2021-01-07 05:05:19,868 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2021-01-07 05:05:20,211 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-01-07 05:05:20,794 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-01-07 05:05:21,110 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2021-01-07 05:05:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:24,262 INFO L93 Difference]: Finished difference Result 764 states and 848 transitions. [2021-01-07 05:05:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-01-07 05:05:24,262 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 52 [2021-01-07 05:05:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:24,265 INFO L225 Difference]: With dead ends: 764 [2021-01-07 05:05:24,265 INFO L226 Difference]: Without dead ends: 737 [2021-01-07 05:05:24,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=555, Invalid=6585, Unknown=0, NotChecked=0, Total=7140 [2021-01-07 05:05:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2021-01-07 05:05:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 661. [2021-01-07 05:05:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2021-01-07 05:05:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 747 transitions. [2021-01-07 05:05:24,276 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 747 transitions. Word has length 52 [2021-01-07 05:05:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:24,277 INFO L481 AbstractCegarLoop]: Abstraction has 661 states and 747 transitions. [2021-01-07 05:05:24,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2021-01-07 05:05:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 747 transitions. [2021-01-07 05:05:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:05:24,278 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:24,278 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:24,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:24,493 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1083226314, now seen corresponding path program 5 times [2021-01-07 05:05:24,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:24,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099114599] [2021-01-07 05:05:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:24,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099114599] [2021-01-07 05:05:24,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645504826] [2021-01-07 05:05:24,792 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:24,878 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-01-07 05:05:24,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:05:24,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2021-01-07 05:05:24,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:24,909 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:24,909 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:05:24,910 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:24,936 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:05:24,938 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:05:24,938 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:05:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:25,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:25,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2021-01-07 05:05:25,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859101650] [2021-01-07 05:05:25,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-07 05:05:25,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:25,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-07 05:05:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:05:25,446 INFO L87 Difference]: Start difference. First operand 661 states and 747 transitions. Second operand 28 states. [2021-01-07 05:05:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:27,481 INFO L93 Difference]: Finished difference Result 1030 states and 1120 transitions. [2021-01-07 05:05:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:05:27,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2021-01-07 05:05:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:27,486 INFO L225 Difference]: With dead ends: 1030 [2021-01-07 05:05:27,486 INFO L226 Difference]: Without dead ends: 994 [2021-01-07 05:05:27,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 05:05:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-01-07 05:05:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 622. [2021-01-07 05:05:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2021-01-07 05:05:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 695 transitions. [2021-01-07 05:05:27,499 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 695 transitions. Word has length 53 [2021-01-07 05:05:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:27,500 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 695 transitions. [2021-01-07 05:05:27,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-07 05:05:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 695 transitions. [2021-01-07 05:05:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 05:05:27,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:27,501 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:27,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-01-07 05:05:27,715 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 97693371, now seen corresponding path program 10 times [2021-01-07 05:05:27,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:27,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27041032] [2021-01-07 05:05:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 85 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:05:27,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27041032] [2021-01-07 05:05:27,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295427935] [2021-01-07 05:05:27,992 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:28,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:05:28,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:05:28,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 58 conjunts are in the unsatisfiable core [2021-01-07 05:05:28,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:28,368 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:05:28,369 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:28,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:28,380 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:05:28,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2021-01-07 05:05:29,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:29,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:05:30,003 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:30,003 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 103 [2021-01-07 05:05:30,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:30,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:30,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:30,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:30,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:30,013 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:30,075 INFO L625 ElimStorePlain]: treesize reduction 9, result has 85.9 percent of original size [2021-01-07 05:05:30,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:05:30,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:3 [2021-01-07 05:05:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 85 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:05:30,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:30,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29] total 45 [2021-01-07 05:05:30,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341487736] [2021-01-07 05:05:30,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-01-07 05:05:30,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:30,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-01-07 05:05:30,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1829, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:05:30,119 INFO L87 Difference]: Start difference. First operand 622 states and 695 transitions. Second operand 45 states. [2021-01-07 05:05:42,099 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-01-07 05:05:42,446 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-01-07 05:05:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:44,722 INFO L93 Difference]: Finished difference Result 1446 states and 1559 transitions. [2021-01-07 05:05:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-01-07 05:05:44,723 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2021-01-07 05:05:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:44,727 INFO L225 Difference]: With dead ends: 1446 [2021-01-07 05:05:44,728 INFO L226 Difference]: Without dead ends: 1426 [2021-01-07 05:05:44,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6329 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1846, Invalid=19324, Unknown=0, NotChecked=0, Total=21170 [2021-01-07 05:05:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2021-01-07 05:05:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 746. [2021-01-07 05:05:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2021-01-07 05:05:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 835 transitions. [2021-01-07 05:05:44,743 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 835 transitions. Word has length 54 [2021-01-07 05:05:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:44,743 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 835 transitions. [2021-01-07 05:05:44,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2021-01-07 05:05:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 835 transitions. [2021-01-07 05:05:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 05:05:44,745 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:44,745 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:44,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-01-07 05:05:44,959 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:44,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:44,960 INFO L82 PathProgramCache]: Analyzing trace with hash 411662583, now seen corresponding path program 6 times [2021-01-07 05:05:44,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:44,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666337036] [2021-01-07 05:05:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:45,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666337036] [2021-01-07 05:05:45,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744420241] [2021-01-07 05:05:45,256 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:45,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-01-07 05:05:45,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:05:45,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-07 05:05:45,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:45,372 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:45,373 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:05:45,374 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:45,418 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:05:45,421 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:05:45,422 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:05:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 05:05:46,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:46,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2021-01-07 05:05:46,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932746183] [2021-01-07 05:05:46,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:05:46,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:05:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:05:46,026 INFO L87 Difference]: Start difference. First operand 746 states and 835 transitions. Second operand 30 states. [2021-01-07 05:05:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:05:53,146 INFO L93 Difference]: Finished difference Result 1134 states and 1224 transitions. [2021-01-07 05:05:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-01-07 05:05:53,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2021-01-07 05:05:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:05:53,151 INFO L225 Difference]: With dead ends: 1134 [2021-01-07 05:05:53,151 INFO L226 Difference]: Without dead ends: 1067 [2021-01-07 05:05:53,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1427, Invalid=5215, Unknown=0, NotChecked=0, Total=6642 [2021-01-07 05:05:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2021-01-07 05:05:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 755. [2021-01-07 05:05:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2021-01-07 05:05:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 844 transitions. [2021-01-07 05:05:53,166 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 844 transitions. Word has length 54 [2021-01-07 05:05:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:05:53,166 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 844 transitions. [2021-01-07 05:05:53,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:05:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 844 transitions. [2021-01-07 05:05:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:05:53,168 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:05:53,168 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:05:53,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-01-07 05:05:53,383 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:05:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:05:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash 126995243, now seen corresponding path program 9 times [2021-01-07 05:05:53,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:05:53,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653840576] [2021-01-07 05:05:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:05:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:05:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:53,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653840576] [2021-01-07 05:05:53,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723415178] [2021-01-07 05:05:53,714 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:05:53,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-01-07 05:05:53,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:05:53,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2021-01-07 05:05:53,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:05:53,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:53,997 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:05:53,999 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:54,044 INFO L625 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2021-01-07 05:05:54,046 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:05:54,047 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-01-07 05:05:54,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:54,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:54,411 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:05:54,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:54,417 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:05:54,418 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:54,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:54,438 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 2 xjuncts. [2021-01-07 05:05:54,439 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2021-01-07 05:05:54,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-07 05:05:54,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:54,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2021-01-07 05:05:54,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:05:54,794 INFO L443 ElimStorePlain]: Different costs {0=[v_prenex_10], 1=[|#memory_int|]} [2021-01-07 05:05:54,798 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:05:54,799 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:05:54,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:54,827 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:05:54,828 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 15 [2021-01-07 05:05:54,829 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 05:05:54,860 INFO L625 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-01-07 05:05:54,862 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:05:54,862 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2021-01-07 05:05:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:05:55,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:05:55,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2021-01-07 05:05:55,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342477800] [2021-01-07 05:05:55,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-01-07 05:05:55,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:05:55,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-01-07 05:05:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:05:55,354 INFO L87 Difference]: Start difference. First operand 755 states and 844 transitions. Second operand 36 states. [2021-01-07 05:05:56,790 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2021-01-07 05:05:57,108 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2021-01-07 05:06:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:00,157 INFO L93 Difference]: Finished difference Result 870 states and 949 transitions. [2021-01-07 05:06:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-01-07 05:06:00,158 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2021-01-07 05:06:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:00,161 INFO L225 Difference]: With dead ends: 870 [2021-01-07 05:06:00,161 INFO L226 Difference]: Without dead ends: 870 [2021-01-07 05:06:00,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=723, Invalid=3699, Unknown=0, NotChecked=0, Total=4422 [2021-01-07 05:06:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-01-07 05:06:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 760. [2021-01-07 05:06:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2021-01-07 05:06:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 849 transitions. [2021-01-07 05:06:00,172 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 849 transitions. Word has length 56 [2021-01-07 05:06:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:00,172 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 849 transitions. [2021-01-07 05:06:00,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2021-01-07 05:06:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 849 transitions. [2021-01-07 05:06:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:06:00,174 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:00,174 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:00,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-01-07 05:06:00,389 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:00,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1725129529, now seen corresponding path program 7 times [2021-01-07 05:06:00,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:00,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849234541] [2021-01-07 05:06:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:00,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849234541] [2021-01-07 05:06:00,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048159279] [2021-01-07 05:06:00,804 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:00,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 61 conjunts are in the unsatisfiable core [2021-01-07 05:06:00,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:00,914 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:00,915 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:06:00,916 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:00,952 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:06:00,954 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:06:00,955 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:06:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:01,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:01,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-01-07 05:06:01,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943427014] [2021-01-07 05:06:01,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:06:01,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:01,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:06:01,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:06:01,692 INFO L87 Difference]: Start difference. First operand 760 states and 849 transitions. Second operand 31 states. [2021-01-07 05:06:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:03,954 INFO L93 Difference]: Finished difference Result 940 states and 1025 transitions. [2021-01-07 05:06:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:06:03,955 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2021-01-07 05:06:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:03,960 INFO L225 Difference]: With dead ends: 940 [2021-01-07 05:06:03,960 INFO L226 Difference]: Without dead ends: 913 [2021-01-07 05:06:03,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:06:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-01-07 05:06:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 760. [2021-01-07 05:06:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2021-01-07 05:06:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 849 transitions. [2021-01-07 05:06:03,969 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 849 transitions. Word has length 56 [2021-01-07 05:06:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:03,970 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 849 transitions. [2021-01-07 05:06:03,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:06:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 849 transitions. [2021-01-07 05:06:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 05:06:03,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:03,971 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:04,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:04,180 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash -358114732, now seen corresponding path program 5 times [2021-01-07 05:06:04,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:04,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043760275] [2021-01-07 05:06:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:04,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043760275] [2021-01-07 05:06:04,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595493293] [2021-01-07 05:06:04,534 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:04,698 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-01-07 05:06:04,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:06:04,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 82 conjunts are in the unsatisfiable core [2021-01-07 05:06:04,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:04,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:06:04,738 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:04,738 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 1 case distinctions, treesize of input 9 treesize of output 25 [2021-01-07 05:06:04,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:04,778 INFO L625 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2021-01-07 05:06:04,781 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:06:04,782 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2021-01-07 05:06:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:05,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:05,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-01-07 05:06:05,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080131664] [2021-01-07 05:06:05,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:06:05,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:06:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:06:05,477 INFO L87 Difference]: Start difference. First operand 760 states and 849 transitions. Second operand 31 states. [2021-01-07 05:06:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:07,756 INFO L93 Difference]: Finished difference Result 861 states and 944 transitions. [2021-01-07 05:06:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:06:07,757 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2021-01-07 05:06:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:07,762 INFO L225 Difference]: With dead ends: 861 [2021-01-07 05:06:07,763 INFO L226 Difference]: Without dead ends: 861 [2021-01-07 05:06:07,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=266, Invalid=1714, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:06:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-01-07 05:06:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 762. [2021-01-07 05:06:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2021-01-07 05:06:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 851 transitions. [2021-01-07 05:06:07,771 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 851 transitions. Word has length 57 [2021-01-07 05:06:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:07,771 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 851 transitions. [2021-01-07 05:06:07,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:06:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 851 transitions. [2021-01-07 05:06:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 05:06:07,773 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:07,773 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:07,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:07,989 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1967721474, now seen corresponding path program 11 times [2021-01-07 05:06:07,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:07,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083497513] [2021-01-07 05:06:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 28 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:08,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083497513] [2021-01-07 05:06:08,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795920981] [2021-01-07 05:06:08,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:08,461 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-01-07 05:06:08,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:06:08,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 53 conjunts are in the unsatisfiable core [2021-01-07 05:06:08,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:08,496 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:08,497 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:06:08,498 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:08,534 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:06:08,537 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:06:08,538 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:11 [2021-01-07 05:06:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:09,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:09,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2021-01-07 05:06:09,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405820039] [2021-01-07 05:06:09,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-07 05:06:09,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:09,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-07 05:06:09,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2021-01-07 05:06:09,203 INFO L87 Difference]: Start difference. First operand 762 states and 851 transitions. Second operand 32 states. [2021-01-07 05:06:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:11,045 INFO L93 Difference]: Finished difference Result 1472 states and 1594 transitions. [2021-01-07 05:06:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:06:11,046 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2021-01-07 05:06:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:11,052 INFO L225 Difference]: With dead ends: 1472 [2021-01-07 05:06:11,052 INFO L226 Difference]: Without dead ends: 1472 [2021-01-07 05:06:11,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=418, Invalid=1838, Unknown=0, NotChecked=0, Total=2256 [2021-01-07 05:06:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2021-01-07 05:06:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 780. [2021-01-07 05:06:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2021-01-07 05:06:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 874 transitions. [2021-01-07 05:06:11,063 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 874 transitions. Word has length 58 [2021-01-07 05:06:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:11,063 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 874 transitions. [2021-01-07 05:06:11,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-07 05:06:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 874 transitions. [2021-01-07 05:06:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-07 05:06:11,065 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:11,065 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:11,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2021-01-07 05:06:11,275 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:11,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash 102819635, now seen corresponding path program 10 times [2021-01-07 05:06:11,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:11,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228188875] [2021-01-07 05:06:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:12,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228188875] [2021-01-07 05:06:12,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913281313] [2021-01-07 05:06:12,373 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:12,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:06:12,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:06:12,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 88 conjunts are in the unsatisfiable core [2021-01-07 05:06:12,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:12,473 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|v_#valid_34|]} [2021-01-07 05:06:12,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:06:12,479 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:06:12,480 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:12,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:12,497 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:06:12,499 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:12,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:12,516 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:06:12,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-01-07 05:06:13,019 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-01-07 05:06:13,020 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:13,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:13,032 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:06:13,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2021-01-07 05:06:13,124 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 27 treesize of output 26 [2021-01-07 05:06:13,126 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:13,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:13,140 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:06:13,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2021-01-07 05:06:13,520 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:13,521 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 61 [2021-01-07 05:06:13,523 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:13,579 INFO L625 ElimStorePlain]: treesize reduction 19, result has 74.3 percent of original size [2021-01-07 05:06:13,582 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:06:13,582 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:51, output treesize:30 [2021-01-07 05:06:13,813 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 24 treesize of output 23 [2021-01-07 05:06:13,814 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:13,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:13,832 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:06:13,832 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2021-01-07 05:06:14,082 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 24 treesize of output 23 [2021-01-07 05:06:14,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:14,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:14,102 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:06:14,103 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2021-01-07 05:06:14,372 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 24 treesize of output 23 [2021-01-07 05:06:14,374 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:14,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:14,392 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:06:14,392 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2021-01-07 05:06:14,664 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 24 treesize of output 23 [2021-01-07 05:06:14,665 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:14,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:14,683 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:06:14,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:26 [2021-01-07 05:06:14,931 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 25 treesize of output 19 [2021-01-07 05:06:14,933 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:06:14,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:14,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:06:14,960 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:14,961 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 18 treesize of output 10 [2021-01-07 05:06:14,961 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:14,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:14,976 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:06:14,976 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2021-01-07 05:06:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:14,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:14,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 50 [2021-01-07 05:06:14,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312394772] [2021-01-07 05:06:14,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-01-07 05:06:14,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:14,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-01-07 05:06:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2305, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:06:15,000 INFO L87 Difference]: Start difference. First operand 780 states and 874 transitions. Second operand 50 states. [2021-01-07 05:06:17,694 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-01-07 05:06:18,865 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-01-07 05:06:20,205 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-01-07 05:06:20,644 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-01-07 05:06:22,596 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-01-07 05:06:24,608 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-01-07 05:06:25,957 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2021-01-07 05:06:26,824 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2021-01-07 05:06:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:34,043 INFO L93 Difference]: Finished difference Result 1103 states and 1216 transitions. [2021-01-07 05:06:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-01-07 05:06:34,044 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 60 [2021-01-07 05:06:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:34,050 INFO L225 Difference]: With dead ends: 1103 [2021-01-07 05:06:34,050 INFO L226 Difference]: Without dead ends: 1072 [2021-01-07 05:06:34,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1053, Invalid=12753, Unknown=0, NotChecked=0, Total=13806 [2021-01-07 05:06:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-07 05:06:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 935. [2021-01-07 05:06:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2021-01-07 05:06:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1055 transitions. [2021-01-07 05:06:34,063 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1055 transitions. Word has length 60 [2021-01-07 05:06:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:34,063 INFO L481 AbstractCegarLoop]: Abstraction has 935 states and 1055 transitions. [2021-01-07 05:06:34,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2021-01-07 05:06:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1055 transitions. [2021-01-07 05:06:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-07 05:06:34,065 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:34,065 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:34,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:34,281 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1052716770, now seen corresponding path program 8 times [2021-01-07 05:06:34,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:34,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728219856] [2021-01-07 05:06:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:34,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728219856] [2021-01-07 05:06:34,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850460015] [2021-01-07 05:06:34,766 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:34,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:06:34,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:06:34,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-07 05:06:34,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:34,870 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:34,871 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:06:34,872 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:34,914 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:06:34,916 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:06:34,917 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:06:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 05:06:35,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:35,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2021-01-07 05:06:35,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400841139] [2021-01-07 05:06:35,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:06:35,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:35,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:06:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:06:35,716 INFO L87 Difference]: Start difference. First operand 935 states and 1055 transitions. Second operand 33 states. [2021-01-07 05:06:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:40,736 INFO L93 Difference]: Finished difference Result 1581 states and 1708 transitions. [2021-01-07 05:06:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-07 05:06:40,738 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2021-01-07 05:06:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:40,742 INFO L225 Difference]: With dead ends: 1581 [2021-01-07 05:06:40,743 INFO L226 Difference]: Without dead ends: 1498 [2021-01-07 05:06:40,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=548, Invalid=2758, Unknown=0, NotChecked=0, Total=3306 [2021-01-07 05:06:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2021-01-07 05:06:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 880. [2021-01-07 05:06:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2021-01-07 05:06:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 981 transitions. [2021-01-07 05:06:40,765 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 981 transitions. Word has length 60 [2021-01-07 05:06:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:40,765 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 981 transitions. [2021-01-07 05:06:40,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 05:06:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 981 transitions. [2021-01-07 05:06:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-07 05:06:40,766 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:40,766 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:40,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:40,968 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1618209099, now seen corresponding path program 12 times [2021-01-07 05:06:40,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:40,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638647936] [2021-01-07 05:06:40,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 33 proven. 123 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:06:41,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638647936] [2021-01-07 05:06:41,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32057074] [2021-01-07 05:06:41,428 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:41,556 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-01-07 05:06:41,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:06:41,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 51 conjunts are in the unsatisfiable core [2021-01-07 05:06:41,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:41,919 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:06:41,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:41,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:41,935 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:06:41,935 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2021-01-07 05:06:42,119 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:06:42,121 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:42,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:42,124 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:06:42,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 05:06:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 33 proven. 123 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:06:42,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:42,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 32 [2021-01-07 05:06:42,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758403965] [2021-01-07 05:06:42,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-07 05:06:42,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-07 05:06:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2021-01-07 05:06:42,139 INFO L87 Difference]: Start difference. First operand 880 states and 981 transitions. Second operand 32 states. [2021-01-07 05:06:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:45,045 INFO L93 Difference]: Finished difference Result 2083 states and 2239 transitions. [2021-01-07 05:06:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:06:45,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2021-01-07 05:06:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:45,054 INFO L225 Difference]: With dead ends: 2083 [2021-01-07 05:06:45,054 INFO L226 Difference]: Without dead ends: 2060 [2021-01-07 05:06:45,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:06:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2021-01-07 05:06:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1046. [2021-01-07 05:06:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2021-01-07 05:06:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1169 transitions. [2021-01-07 05:06:45,079 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1169 transitions. Word has length 61 [2021-01-07 05:06:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:45,079 INFO L481 AbstractCegarLoop]: Abstraction has 1046 states and 1169 transitions. [2021-01-07 05:06:45,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-07 05:06:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1169 transitions. [2021-01-07 05:06:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 05:06:45,081 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:45,081 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:45,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:45,295 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:45,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1739829774, now seen corresponding path program 9 times [2021-01-07 05:06:45,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:45,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712311280] [2021-01-07 05:06:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:45,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712311280] [2021-01-07 05:06:45,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312197881] [2021-01-07 05:06:45,781 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:45,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-07 05:06:45,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:06:45,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-07 05:06:45,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:45,957 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:45,957 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:06:45,959 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:46,007 INFO L625 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2021-01-07 05:06:46,009 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:06:46,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2021-01-07 05:06:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:47,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:47,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2021-01-07 05:06:47,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335716228] [2021-01-07 05:06:47,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-01-07 05:06:47,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:47,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-01-07 05:06:47,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:06:47,091 INFO L87 Difference]: Start difference. First operand 1046 states and 1169 transitions. Second operand 35 states. [2021-01-07 05:06:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:06:51,682 INFO L93 Difference]: Finished difference Result 1499 states and 1625 transitions. [2021-01-07 05:06:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:06:51,683 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 62 [2021-01-07 05:06:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:06:51,692 INFO L225 Difference]: With dead ends: 1499 [2021-01-07 05:06:51,692 INFO L226 Difference]: Without dead ends: 1462 [2021-01-07 05:06:51,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=585, Invalid=2495, Unknown=0, NotChecked=0, Total=3080 [2021-01-07 05:06:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2021-01-07 05:06:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1052. [2021-01-07 05:06:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2021-01-07 05:06:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1175 transitions. [2021-01-07 05:06:51,708 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1175 transitions. Word has length 62 [2021-01-07 05:06:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:06:51,709 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1175 transitions. [2021-01-07 05:06:51,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-01-07 05:06:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1175 transitions. [2021-01-07 05:06:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 05:06:51,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:06:51,712 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:06:51,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2021-01-07 05:06:51,926 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2021-01-07 05:06:51,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:06:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash -983535333, now seen corresponding path program 10 times [2021-01-07 05:06:51,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:06:51,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547811923] [2021-01-07 05:06:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:06:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:06:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:06:52,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547811923] [2021-01-07 05:06:52,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137852839] [2021-01-07 05:06:52,455 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:06:52,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:06:52,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:06:52,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 98 conjunts are in the unsatisfiable core [2021-01-07 05:06:52,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:06:52,586 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_49|], 1=[|v_#valid_35|]} [2021-01-07 05:06:52,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:06:52,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:06:52,594 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:06:52,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:52,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:52,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:06:52,620 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:06:52,622 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:52,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:52,639 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:06:52,640 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2021-01-07 05:06:52,747 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-01-07 05:06:52,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:06:52,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:52,761 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:06:52,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-01-07 05:06:52,952 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:52,953 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 18 treesize of output 18 [2021-01-07 05:06:52,955 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:06:52,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:06:52,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:06:52,984 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:06:52,986 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:06:52,987 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:44 [2021-01-07 05:06:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-01-07 05:06:54,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:06:54,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2021-01-07 05:06:54,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879654380] [2021-01-07 05:06:54,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:06:54,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:06:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:06:54,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=987, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:06:54,017 INFO L87 Difference]: Start difference. First operand 1052 states and 1175 transitions. Second operand 33 states. [2021-01-07 05:06:57,351 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2021-01-07 05:06:57,606 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2021-01-07 05:06:57,850 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2021-01-07 05:06:59,820 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-01-07 05:07:01,586 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-07 05:07:01,826 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2021-01-07 05:07:02,015 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2021-01-07 05:07:02,201 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-07 05:07:02,825 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2021-01-07 05:07:04,535 WARN L197 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2021-01-07 05:07:05,124 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-01-07 05:07:05,711 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56