./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 440325a953e10d2173456ab8f8c8fc1313a6b958 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 20:49:17,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:49:17,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:49:17,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:49:17,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:49:17,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:49:17,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:49:17,157 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:49:17,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:49:17,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:49:17,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:49:17,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:49:17,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:49:17,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:49:17,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:49:17,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:49:17,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:49:17,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:49:17,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:49:17,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:49:17,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:49:17,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:49:17,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:49:17,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:49:17,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:49:17,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:49:17,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:49:17,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:49:17,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:49:17,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:49:17,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:49:17,206 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:49:17,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:49:17,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:49:17,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:49:17,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:49:17,210 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:49:17,235 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:49:17,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:49:17,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:49:17,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:49:17,240 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:49:17,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:49:17,241 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:49:17,241 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:49:17,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:49:17,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:49:17,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:49:17,243 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:49:17,243 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:49:17,243 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:49:17,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:49:17,243 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:49:17,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:49:17,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:49:17,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:49:17,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:49:17,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:17,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:49:17,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:49:17,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:49:17,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:49:17,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2019-01-14 20:49:17,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:49:17,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:49:17,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:49:17,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:49:17,322 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:49:17,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2019-01-14 20:49:17,380 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62018ba14/6dd91d78b87746a8a4a38c15705afef8/FLAG334708f28 [2019-01-14 20:49:17,796 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:49:17,797 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2019-01-14 20:49:17,804 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62018ba14/6dd91d78b87746a8a4a38c15705afef8/FLAG334708f28 [2019-01-14 20:49:18,177 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62018ba14/6dd91d78b87746a8a4a38c15705afef8 [2019-01-14 20:49:18,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:49:18,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:49:18,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:18,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:49:18,187 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:49:18,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5c3be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18, skipping insertion in model container [2019-01-14 20:49:18,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:49:18,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:49:18,410 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:18,427 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:49:18,449 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:18,476 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:49:18,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18 WrapperNode [2019-01-14 20:49:18,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:18,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:49:18,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:49:18,478 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:49:18,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... [2019-01-14 20:49:18,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:49:18,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:49:18,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:49:18,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:49:18,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-01-14 20:49:18,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:49:18,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:49:18,658 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-14 20:49:18,658 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-14 20:49:18,658 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-01-14 20:49:18,658 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-01-14 20:49:18,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:49:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-14 20:49:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-14 20:49:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:49:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-14 20:49:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:49:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-01-14 20:49:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 20:49:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:49:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-01-14 20:49:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:49:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:49:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 20:49:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:49:19,375 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:49:19,375 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 20:49:19,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:19 BoogieIcfgContainer [2019-01-14 20:49:19,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:49:19,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:49:19,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:49:19,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:49:19,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:49:18" (1/3) ... [2019-01-14 20:49:19,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9d47b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:19, skipping insertion in model container [2019-01-14 20:49:19,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:18" (2/3) ... [2019-01-14 20:49:19,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9d47b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:19, skipping insertion in model container [2019-01-14 20:49:19,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:19" (3/3) ... [2019-01-14 20:49:19,387 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2019-01-14 20:49:19,396 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:49:19,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-14 20:49:19,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-14 20:49:19,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:49:19,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:49:19,438 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:49:19,438 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:49:19,439 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:49:19,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:49:19,439 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:49:19,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:49:19,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:49:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-14 20:49:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:19,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:19,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:19,469 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-01-14 20:49:19,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:19,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:19,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:19,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:19,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:19,776 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-01-14 20:49:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:20,006 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 20:49:20,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:20,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 20:49:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:20,021 INFO L225 Difference]: With dead ends: 69 [2019-01-14 20:49:20,021 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 20:49:20,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 20:49:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-14 20:49:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 20:49:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-01-14 20:49:20,072 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2019-01-14 20:49:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:20,073 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-01-14 20:49:20,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-01-14 20:49:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:20,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:20,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:20,075 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-01-14 20:49:20,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:20,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:20,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:20,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:20,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 20:49:20,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 20:49:20,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 20:49:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:49:20,379 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 4 states. [2019-01-14 20:49:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:20,808 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 20:49:20,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:49:20,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 20:49:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:20,811 INFO L225 Difference]: With dead ends: 69 [2019-01-14 20:49:20,811 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 20:49:20,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:49:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 20:49:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-14 20:49:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 20:49:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-01-14 20:49:20,822 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 12 [2019-01-14 20:49:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:20,823 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-01-14 20:49:20,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 20:49:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-01-14 20:49:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 20:49:20,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:20,824 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:20,825 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-01-14 20:49:20,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:20,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:20,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:21,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:21,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:21,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:21,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:21,238 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 20:49:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-14 20:49:21,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 20:49:21,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,482 INFO L303 Elim1Store]: Index analysis took 122 ms [2019-01-14 20:49:21,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2019-01-14 20:49:21,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:21,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:21,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:21,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:21,766 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-14 20:49:21,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 49 [2019-01-14 20:49:21,931 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-14 20:49:21,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:21,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 57 [2019-01-14 20:49:22,113 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-01-14 20:49:22,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2019-01-14 20:49:22,129 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:22,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2019-01-14 20:49:22,206 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:22,274 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:22,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2019-01-14 20:49:22,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:22,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:49:22,509 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:22,534 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:22,549 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:22,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:22,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:49:22,588 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-14 20:49:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:22,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:22,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-14 20:49:22,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:22,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:22,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:22,857 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 10 states. [2019-01-14 20:49:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:23,401 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-01-14 20:49:23,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:23,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-14 20:49:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:23,404 INFO L225 Difference]: With dead ends: 72 [2019-01-14 20:49:23,404 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 20:49:23,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 20:49:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-14 20:49:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 20:49:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-01-14 20:49:23,413 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 15 [2019-01-14 20:49:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:23,414 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-01-14 20:49:23,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-01-14 20:49:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 20:49:23,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:23,415 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:23,415 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash -16477363, now seen corresponding path program 1 times [2019-01-14 20:49:23,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:23,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:23,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 20:49:23,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:23,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:49:23,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:23,532 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2019-01-14 20:49:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:23,792 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-14 20:49:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:23,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 20:49:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:23,795 INFO L225 Difference]: With dead ends: 71 [2019-01-14 20:49:23,795 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 20:49:23,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 20:49:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-14 20:49:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 20:49:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-14 20:49:23,804 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2019-01-14 20:49:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:23,805 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-14 20:49:23,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-14 20:49:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 20:49:23,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:23,806 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:23,806 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:23,806 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 1 times [2019-01-14 20:49:23,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:23,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:23,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:23,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:24,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:24,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:24,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:24,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:24,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:49:24,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:49:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:49:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:24,350 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 7 states. [2019-01-14 20:49:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:24,400 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-01-14 20:49:24,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:24,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-14 20:49:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:24,409 INFO L225 Difference]: With dead ends: 76 [2019-01-14 20:49:24,409 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 20:49:24,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 20:49:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-01-14 20:49:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 20:49:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-01-14 20:49:24,416 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 26 [2019-01-14 20:49:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:24,417 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-01-14 20:49:24,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:49:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-01-14 20:49:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 20:49:24,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:24,418 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:24,418 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 502160117, now seen corresponding path program 2 times [2019-01-14 20:49:24,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:24,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:24,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:24,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:24,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:24,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:24,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:24,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:24,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:24,736 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 20:49:24,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:24,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-14 20:49:24,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:24,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:24,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 20:49:24,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:24,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:24,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:24,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:24,948 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-14 20:49:24,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2019-01-14 20:49:24,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:25,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:25,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:25,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:25,399 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-14 20:49:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 49 [2019-01-14 20:49:25,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 57 [2019-01-14 20:49:25,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 20:49:25,632 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:25,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,839 INFO L303 Elim1Store]: Index analysis took 172 ms [2019-01-14 20:49:25,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2019-01-14 20:49:25,841 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:25,941 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:25,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:25,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2019-01-14 20:49:26,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:26,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:26,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:26,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:26,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:26,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:49:26,032 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:26,043 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:26,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:26,074 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:26,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:49:26,092 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-14 20:49:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 20:49:26,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:26,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-14 20:49:26,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:49:26,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:49:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:26,469 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 12 states. [2019-01-14 20:49:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:27,428 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-01-14 20:49:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:27,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-01-14 20:49:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:27,430 INFO L225 Difference]: With dead ends: 79 [2019-01-14 20:49:27,431 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 20:49:27,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-01-14 20:49:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 20:49:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-01-14 20:49:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 20:49:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-01-14 20:49:27,443 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2019-01-14 20:49:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:27,443 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-01-14 20:49:27,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:49:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-01-14 20:49:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 20:49:27,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:27,444 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:27,445 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:27,445 INFO L82 PathProgramCache]: Analyzing trace with hash 532455402, now seen corresponding path program 1 times [2019-01-14 20:49:27,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:27,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:27,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:27,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:27,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:27,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:27,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:27,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 20:49:27,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:49:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:49:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:27,816 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 9 states. [2019-01-14 20:49:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:27,897 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-14 20:49:27,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:27,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-14 20:49:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:27,899 INFO L225 Difference]: With dead ends: 82 [2019-01-14 20:49:27,899 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 20:49:27,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 20:49:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-14 20:49:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 20:49:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-01-14 20:49:27,906 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 33 [2019-01-14 20:49:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:27,906 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-01-14 20:49:27,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:49:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-01-14 20:49:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 20:49:27,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:27,908 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:27,908 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:27,908 INFO L82 PathProgramCache]: Analyzing trace with hash -428261789, now seen corresponding path program 2 times [2019-01-14 20:49:27,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:27,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:28,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:28,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:28,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:28,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:28,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:28,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:28,138 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2019-01-14 20:49:28,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2019-01-14 20:49:28,349 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-14 20:49:28,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 66 [2019-01-14 20:49:28,531 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-14 20:49:28,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 64 [2019-01-14 20:49:28,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2019-01-14 20:49:28,546 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:28,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:28,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 74 [2019-01-14 20:49:28,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2019-01-14 20:49:28,654 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:28,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:28,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 72 [2019-01-14 20:49:28,753 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 20:49:28,852 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:49:28,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:49:29,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:29,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:29,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 56 [2019-01-14 20:49:29,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:29,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:29,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:29,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:29,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:29,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-14 20:49:29,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2019-01-14 20:49:29,217 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:29,255 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:29,289 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:29,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 20:49:29,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 20:49:29,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-14 20:49:29,903 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:61, output treesize:234 [2019-01-14 20:49:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-14 20:49:30,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:30,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-01-14 20:49:30,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:30,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:30,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:30,416 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 10 states. [2019-01-14 20:49:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:31,167 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-01-14 20:49:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:31,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-14 20:49:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:31,169 INFO L225 Difference]: With dead ends: 84 [2019-01-14 20:49:31,169 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 20:49:31,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-01-14 20:49:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 20:49:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-01-14 20:49:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-14 20:49:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-01-14 20:49:31,175 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 36 [2019-01-14 20:49:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:31,176 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-01-14 20:49:31,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-01-14 20:49:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 20:49:31,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:31,177 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:31,177 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:31,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash 507961675, now seen corresponding path program 1 times [2019-01-14 20:49:31,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:31,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:31,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:31,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:31,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:31,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:31,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:31,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 20:49:31,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:49:31,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:49:31,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:31,427 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 11 states. [2019-01-14 20:49:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:31,495 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-01-14 20:49:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:31,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-14 20:49:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:31,498 INFO L225 Difference]: With dead ends: 87 [2019-01-14 20:49:31,498 INFO L226 Difference]: Without dead ends: 87 [2019-01-14 20:49:31,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-14 20:49:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-01-14 20:49:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 20:49:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-01-14 20:49:31,507 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2019-01-14 20:49:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:31,507 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-01-14 20:49:31,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:49:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-01-14 20:49:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 20:49:31,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:31,508 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:31,510 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:31,511 INFO L82 PathProgramCache]: Analyzing trace with hash 23527684, now seen corresponding path program 2 times [2019-01-14 20:49:31,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:31,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:32,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:32,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:32,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:32,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:32,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:32,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:32,297 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 20:49:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-14 20:49:32,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 20:49:32,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2019-01-14 20:49:32,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,406 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-14 20:49:32,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 49 [2019-01-14 20:49:32,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 57 [2019-01-14 20:49:32,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2019-01-14 20:49:32,650 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2019-01-14 20:49:32,711 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,731 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2019-01-14 20:49:32,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:32,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:49:32,793 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,808 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,817 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:32,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:49:32,841 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-14 20:49:33,219 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 20:49:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-01-14 20:49:33,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:33,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2019-01-14 20:49:33,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 20:49:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 20:49:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-01-14 20:49:33,415 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 14 states. [2019-01-14 20:49:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:33,868 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-14 20:49:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:49:33,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-01-14 20:49:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:33,869 INFO L225 Difference]: With dead ends: 89 [2019-01-14 20:49:33,869 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 20:49:33,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-14 20:49:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 20:49:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-14 20:49:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 20:49:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-01-14 20:49:33,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 42 [2019-01-14 20:49:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:33,876 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-01-14 20:49:33,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 20:49:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-01-14 20:49:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 20:49:33,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:33,880 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:33,880 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1213368515, now seen corresponding path program 1 times [2019-01-14 20:49:33,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:33,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:33,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:49:34,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:34,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:34,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:34,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:49:34,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:34,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 20:49:34,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:49:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:49:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:34,223 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 13 states. [2019-01-14 20:49:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:34,297 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-01-14 20:49:34,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:34,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-01-14 20:49:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:34,300 INFO L225 Difference]: With dead ends: 90 [2019-01-14 20:49:34,300 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 20:49:34,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 20:49:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-14 20:49:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 20:49:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-01-14 20:49:34,307 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 54 [2019-01-14 20:49:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:34,307 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-01-14 20:49:34,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:49:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-01-14 20:49:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 20:49:34,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:34,312 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:34,312 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash -590033308, now seen corresponding path program 2 times [2019-01-14 20:49:34,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:34,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:49:34,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:34,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:34,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:34,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:34,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:34,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:34,423 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:49:34,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:49:34,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-14 20:49:34,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-14 20:49:34,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-14 20:49:34,475 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:34,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:34,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:34,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 20:49:34,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-14 20:49:34,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-14 20:49:34,575 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:34,585 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:34,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2019-01-14 20:49:34,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2019-01-14 20:49:34,656 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:34,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:34,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2019-01-14 20:49:34,730 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-14 20:49:34,782 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:49:34,837 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:49:34,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 20:49:34,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 20:49:35,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-14 20:49:35,003 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:18, output treesize:114 [2019-01-14 20:49:35,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-14 20:49:35,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:35,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:35,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:35,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2019-01-14 20:49:35,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:49:35,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:49:35,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:48 [2019-01-14 20:49:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:49:35,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:35,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2019-01-14 20:49:35,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:49:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:49:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:35,379 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 8 states. [2019-01-14 20:49:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:35,639 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-01-14 20:49:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:35,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-01-14 20:49:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:35,643 INFO L225 Difference]: With dead ends: 98 [2019-01-14 20:49:35,643 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 20:49:35,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 20:49:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-01-14 20:49:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 20:49:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2019-01-14 20:49:35,649 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 57 [2019-01-14 20:49:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:35,651 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2019-01-14 20:49:35,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:49:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2019-01-14 20:49:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 20:49:35,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:35,653 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:35,655 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash -317183977, now seen corresponding path program 1 times [2019-01-14 20:49:35,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:35,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:35,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:35,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:49:35,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:35,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:35,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:49:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 20:49:35,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:35,921 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 6 states. [2019-01-14 20:49:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:35,971 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-01-14 20:49:35,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:49:35,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-01-14 20:49:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:35,974 INFO L225 Difference]: With dead ends: 103 [2019-01-14 20:49:35,974 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 20:49:35,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 20:49:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-14 20:49:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 20:49:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-01-14 20:49:35,980 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 62 [2019-01-14 20:49:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:35,981 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-01-14 20:49:35,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-01-14 20:49:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 20:49:35,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:35,985 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:35,985 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1648161371, now seen corresponding path program 2 times [2019-01-14 20:49:35,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:35,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:35,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:35,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:49:36,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:36,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:36,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:36,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:36,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:36,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:36,239 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-14 20:49:36,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 49 [2019-01-14 20:49:36,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 57 [2019-01-14 20:49:36,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2019-01-14 20:49:36,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-01-14 20:49:36,530 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2019-01-14 20:49:36,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:49:36,630 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 20:49:36,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-14 20:49:36,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-14 20:49:36,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:36,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2019-01-14 20:49:36,730 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,746 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,756 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,763 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:36,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:49:36,785 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-14 20:49:37,135 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 20:49:37,382 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 20:49:37,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:37,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:37,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:37,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:37,589 INFO L303 Elim1Store]: Index analysis took 203 ms [2019-01-14 20:49:37,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 54 [2019-01-14 20:49:37,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 20:49:38,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-14 20:49:38,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:96 [2019-01-14 20:49:39,561 WARN L181 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-14 20:49:41,676 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 20:49:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-01-14 20:49:41,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:41,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-01-14 20:49:41,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:49:41,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:49:41,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:41,730 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 11 states. [2019-01-14 20:49:42,245 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-01-14 20:49:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:42,387 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-01-14 20:49:42,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 20:49:42,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-01-14 20:49:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:42,391 INFO L225 Difference]: With dead ends: 108 [2019-01-14 20:49:42,391 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 20:49:42,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:49:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 20:49:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-01-14 20:49:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 20:49:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-01-14 20:49:42,395 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 67 [2019-01-14 20:49:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:42,396 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-01-14 20:49:42,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:49:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-01-14 20:49:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 20:49:42,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:42,397 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:42,397 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794825, now seen corresponding path program 1 times [2019-01-14 20:49:42,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:42,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:42,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:42,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:42,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-01-14 20:49:42,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:42,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:42,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:42,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:42,469 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 3 states. [2019-01-14 20:49:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:42,582 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-01-14 20:49:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:42,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-14 20:49:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:42,585 INFO L225 Difference]: With dead ends: 103 [2019-01-14 20:49:42,585 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 20:49:42,585 INFO L631 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 [2019-01-14 20:49:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 20:49:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-14 20:49:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 20:49:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-01-14 20:49:42,589 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 73 [2019-01-14 20:49:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:42,589 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-01-14 20:49:42,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-01-14 20:49:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 20:49:42,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:42,593 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:42,593 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794826, now seen corresponding path program 1 times [2019-01-14 20:49:42,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:42,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:42,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:49:42,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:42,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:42,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:42,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:49:42,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:42,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 20:49:42,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:49:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:49:42,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:42,900 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 8 states. [2019-01-14 20:49:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:42,982 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-01-14 20:49:42,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:49:42,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-01-14 20:49:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:42,987 INFO L225 Difference]: With dead ends: 112 [2019-01-14 20:49:42,987 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 20:49:42,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 20:49:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-01-14 20:49:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 20:49:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-01-14 20:49:42,996 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 73 [2019-01-14 20:49:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:42,996 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-01-14 20:49:42,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:49:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-01-14 20:49:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 20:49:42,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:42,999 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:43,000 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1123262532, now seen corresponding path program 2 times [2019-01-14 20:49:43,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:43,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:43,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:49:43,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:43,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:43,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:43,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:43,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:43,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:43,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 20:49:43,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:43,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:43,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 20:49:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-01-14 20:49:43,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-01-14 20:49:43,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:43,327 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 10 states. [2019-01-14 20:49:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:43,438 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2019-01-14 20:49:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:43,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-01-14 20:49:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:43,442 INFO L225 Difference]: With dead ends: 116 [2019-01-14 20:49:43,442 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 20:49:43,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 20:49:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2019-01-14 20:49:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 20:49:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2019-01-14 20:49:43,446 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 78 [2019-01-14 20:49:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:43,446 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2019-01-14 20:49:43,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2019-01-14 20:49:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 20:49:43,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:43,448 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:43,448 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:43,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1854312006, now seen corresponding path program 1 times [2019-01-14 20:49:43,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:43,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:49:43,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:43,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:43,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:43,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:49:43,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:43,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 20:49:43,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:43,830 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 10 states. [2019-01-14 20:49:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:43,878 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2019-01-14 20:49:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:49:43,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-01-14 20:49:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:43,881 INFO L225 Difference]: With dead ends: 121 [2019-01-14 20:49:43,881 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 20:49:43,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 20:49:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-14 20:49:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 20:49:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-01-14 20:49:43,887 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 92 [2019-01-14 20:49:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:43,887 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-01-14 20:49:43,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-01-14 20:49:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 20:49:43,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:43,892 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:43,892 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 283421384, now seen corresponding path program 2 times [2019-01-14 20:49:43,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:43,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:49:44,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:44,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:44,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:44,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:49:44,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:44,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:49:44,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:44,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 20:49:44,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:49:44,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:49:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:44,228 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 11 states. [2019-01-14 20:49:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:44,291 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-01-14 20:49:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:44,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-01-14 20:49:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:44,295 INFO L225 Difference]: With dead ends: 126 [2019-01-14 20:49:44,295 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 20:49:44,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 20:49:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-01-14 20:49:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 20:49:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2019-01-14 20:49:44,301 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 97 [2019-01-14 20:49:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:44,301 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2019-01-14 20:49:44,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:49:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2019-01-14 20:49:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 20:49:44,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:44,306 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:44,306 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:44,306 INFO L82 PathProgramCache]: Analyzing trace with hash -663164294, now seen corresponding path program 3 times [2019-01-14 20:49:44,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:44,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:49:45,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:45,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:49:45,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 20:49:45,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:45,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-01-14 20:49:45,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:45,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2019-01-14 20:49:45,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:49:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:49:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:45,291 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 13 states. [2019-01-14 20:49:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:45,396 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2019-01-14 20:49:45,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 20:49:45,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2019-01-14 20:49:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:45,400 INFO L225 Difference]: With dead ends: 140 [2019-01-14 20:49:45,402 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 20:49:45,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 20:49:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2019-01-14 20:49:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 20:49:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2019-01-14 20:49:45,407 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 102 [2019-01-14 20:49:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:45,409 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2019-01-14 20:49:45,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:49:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2019-01-14 20:49:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 20:49:45,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:45,412 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:45,412 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -138503934, now seen corresponding path program 4 times [2019-01-14 20:49:45,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:45,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-14 20:49:45,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:45,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:45,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 20:49:45,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 20:49:45,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:45,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-14 20:49:45,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:45,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 20:49:45,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:49:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:49:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:45,723 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 13 states. [2019-01-14 20:49:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:45,837 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-01-14 20:49:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:45,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-01-14 20:49:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:45,839 INFO L225 Difference]: With dead ends: 137 [2019-01-14 20:49:45,839 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 20:49:45,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 20:49:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-14 20:49:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-14 20:49:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-01-14 20:49:45,845 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 112 [2019-01-14 20:49:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:45,845 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-01-14 20:49:45,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:49:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-01-14 20:49:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-14 20:49:45,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:45,846 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:45,846 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1387314960, now seen corresponding path program 5 times [2019-01-14 20:49:45,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:45,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:46,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:46,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:46,014 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 20:49:48,378 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 20:49:48,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:48,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:48,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:48,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 20:49:48,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:48,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:48,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:48,433 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 6 states. [2019-01-14 20:49:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:48,494 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2019-01-14 20:49:48,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:49:48,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-01-14 20:49:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:48,503 INFO L225 Difference]: With dead ends: 146 [2019-01-14 20:49:48,503 INFO L226 Difference]: Without dead ends: 146 [2019-01-14 20:49:48,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-14 20:49:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2019-01-14 20:49:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-14 20:49:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2019-01-14 20:49:48,510 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 117 [2019-01-14 20:49:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:48,510 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2019-01-14 20:49:48,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2019-01-14 20:49:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-14 20:49:48,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:48,511 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:48,514 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash -575903494, now seen corresponding path program 6 times [2019-01-14 20:49:48,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:48,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:48,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:48,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:48,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:48,703 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 20:49:49,024 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 20:49:49,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:49,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:49,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:49,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:49:49,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:49:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:49:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:49,154 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand 7 states. [2019-01-14 20:49:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:49,189 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2019-01-14 20:49:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:49,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2019-01-14 20:49:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:49,192 INFO L225 Difference]: With dead ends: 151 [2019-01-14 20:49:49,192 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 20:49:49,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 20:49:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-01-14 20:49:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-14 20:49:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-01-14 20:49:49,198 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 122 [2019-01-14 20:49:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:49,198 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-01-14 20:49:49,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:49:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-01-14 20:49:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-14 20:49:49,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:49,199 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:49,204 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash -371170992, now seen corresponding path program 7 times [2019-01-14 20:49:49,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:49,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:49,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:49,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:49,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:49,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:49,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:49,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 20:49:49,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:49:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:49:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:49,499 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 8 states. [2019-01-14 20:49:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:49,543 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2019-01-14 20:49:49,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:49:49,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2019-01-14 20:49:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:49,546 INFO L225 Difference]: With dead ends: 156 [2019-01-14 20:49:49,546 INFO L226 Difference]: Without dead ends: 156 [2019-01-14 20:49:49,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-14 20:49:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-01-14 20:49:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-14 20:49:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-01-14 20:49:49,551 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 127 [2019-01-14 20:49:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:49,551 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-01-14 20:49:49,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:49:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-01-14 20:49:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-14 20:49:49,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:49,552 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:49,553 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1244147386, now seen corresponding path program 8 times [2019-01-14 20:49:49,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:49,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:49,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:49,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:49,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:49,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:49,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:49:49,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:49,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:49,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:49,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 20:49:49,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:49:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:49:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:49,901 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 9 states. [2019-01-14 20:49:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:50,032 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-14 20:49:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:50,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-01-14 20:49:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:50,036 INFO L225 Difference]: With dead ends: 161 [2019-01-14 20:49:50,036 INFO L226 Difference]: Without dead ends: 161 [2019-01-14 20:49:50,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-14 20:49:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2019-01-14 20:49:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 20:49:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-01-14 20:49:50,040 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 132 [2019-01-14 20:49:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:50,041 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-01-14 20:49:50,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:49:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-01-14 20:49:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-14 20:49:50,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:50,046 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:50,046 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2070269040, now seen corresponding path program 9 times [2019-01-14 20:49:50,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:50,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:50,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:50,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:50,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:49:50,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 20:49:50,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:50,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:50,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:50,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-01-14 20:49:50,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 20:49:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 20:49:50,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-01-14 20:49:50,704 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 19 states. [2019-01-14 20:49:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:50,906 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-01-14 20:49:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:50,907 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 137 [2019-01-14 20:49:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:50,909 INFO L225 Difference]: With dead ends: 166 [2019-01-14 20:49:50,909 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 20:49:50,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-14 20:49:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 20:49:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-01-14 20:49:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-14 20:49:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2019-01-14 20:49:50,916 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 137 [2019-01-14 20:49:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:50,916 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2019-01-14 20:49:50,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 20:49:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2019-01-14 20:49:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-14 20:49:50,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:50,921 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:50,923 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1106756730, now seen corresponding path program 10 times [2019-01-14 20:49:50,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:50,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:51,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:51,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:51,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 20:49:52,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 20:49:52,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:52,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:52,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:52,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 20:49:52,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:49:52,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:49:52,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:52,411 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand 11 states. [2019-01-14 20:49:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:52,526 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2019-01-14 20:49:52,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:52,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2019-01-14 20:49:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:52,530 INFO L225 Difference]: With dead ends: 171 [2019-01-14 20:49:52,530 INFO L226 Difference]: Without dead ends: 171 [2019-01-14 20:49:52,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-14 20:49:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-01-14 20:49:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-14 20:49:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-01-14 20:49:52,542 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 142 [2019-01-14 20:49:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:52,542 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-01-14 20:49:52,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:49:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-01-14 20:49:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-14 20:49:52,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:52,546 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:52,546 INFO L423 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1612565040, now seen corresponding path program 11 times [2019-01-14 20:49:52,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:52,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:52,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:49:53,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:53,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:53,536 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 20:50:08,798 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 20:50:08,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:08,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:50:08,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:08,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 20:50:08,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:50:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:50:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:50:08,965 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 12 states. [2019-01-14 20:50:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:09,603 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2019-01-14 20:50:09,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 20:50:09,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2019-01-14 20:50:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:09,610 INFO L225 Difference]: With dead ends: 176 [2019-01-14 20:50:09,610 INFO L226 Difference]: Without dead ends: 176 [2019-01-14 20:50:09,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:50:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-14 20:50:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2019-01-14 20:50:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-14 20:50:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2019-01-14 20:50:09,621 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 147 [2019-01-14 20:50:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:09,622 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2019-01-14 20:50:09,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:50:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2019-01-14 20:50:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-14 20:50:09,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:09,629 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:09,629 INFO L423 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:50:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash -896062918, now seen corresponding path program 12 times [2019-01-14 20:50:09,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:09,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:09,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:09,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:09,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:50:10,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:10,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:10,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 20:50:11,883 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-01-14 20:50:11,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:11,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:50:12,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:12,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-01-14 20:50:12,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 20:50:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 20:50:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-01-14 20:50:12,099 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand 25 states. [2019-01-14 20:50:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:12,294 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2019-01-14 20:50:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 20:50:12,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 152 [2019-01-14 20:50:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:12,299 INFO L225 Difference]: With dead ends: 177 [2019-01-14 20:50:12,299 INFO L226 Difference]: Without dead ends: 177 [2019-01-14 20:50:12,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-01-14 20:50:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-14 20:50:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-14 20:50:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-14 20:50:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-01-14 20:50:12,305 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 152 [2019-01-14 20:50:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:12,305 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-01-14 20:50:12,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 20:50:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-01-14 20:50:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-14 20:50:12,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:12,308 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:12,310 INFO L423 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:50:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1136420880, now seen corresponding path program 13 times [2019-01-14 20:50:12,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:12,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:12,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:12,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:50:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:50:12,981 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 20:50:13,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:50:13 BoogieIcfgContainer [2019-01-14 20:50:13,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:50:13,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:50:13,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:50:13,130 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:50:13,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:19" (3/4) ... [2019-01-14 20:50:13,137 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 20:50:13,252 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:50:13,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:50:13,257 INFO L168 Benchmark]: Toolchain (without parser) took 55075.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 948.7 MB in the beginning and 872.7 MB in the end (delta: 76.0 MB). Peak memory consumption was 478.1 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:13,259 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:50:13,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:13,259 INFO L168 Benchmark]: Boogie Preprocessor took 114.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -205.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:13,260 INFO L168 Benchmark]: RCFGBuilder took 780.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:13,262 INFO L168 Benchmark]: TraceAbstraction took 53751.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.1 GB in the beginning and 872.7 MB in the end (delta: 225.7 MB). Peak memory consumption was 486.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:13,263 INFO L168 Benchmark]: Witness Printer took 126.10 ms. Allocated memory is still 1.4 GB. Free memory was 872.7 MB in the beginning and 872.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 20:50:13,268 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -205.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 780.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53751.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.1 GB in the beginning and 872.7 MB in the end (delta: 225.7 MB). Peak memory consumption was 486.8 MB. Max. memory is 11.5 GB. * Witness Printer took 126.10 ms. Allocated memory is still 1.4 GB. Free memory was 872.7 MB in the beginning and 872.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L45] CALL getNumbers4() VAL [array={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L35] CALL, EXPR getNumbers3() VAL [array={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L25] CALL, EXPR getNumbers2() VAL [array={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L16] CALL, EXPR getNumbers() VAL [array={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L8] int i = 0; VAL [array={-3:0}, i=0, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=0, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=0, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=1, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=1, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=1, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=2, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=2, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=2, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=3, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=3, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=3, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=4, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=4, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=4, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=5, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=5, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=5, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=6, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=6, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=6, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=7, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=7, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=7, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=8, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=8, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=8, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=9, numbers2={-1:0}, numbers4={-4:0}] [L8] COND TRUE i < 10 VAL [array={-3:0}, i=9, numbers2={-1:0}, numbers4={-4:0}] [L9] array[i] = i VAL [array={-3:0}, i=9, numbers2={-1:0}, numbers4={-4:0}] [L8] ++i VAL [array={-3:0}, i=10, numbers2={-1:0}, numbers4={-4:0}] [L8] COND FALSE !(i < 10) VAL [array={-3:0}, i=10, numbers2={-1:0}, numbers4={-4:0}] [L12] return array; VAL [\result={-3:0}, array={-3:0}, i=10, numbers2={-1:0}, numbers4={-4:0}] [L16] RET, EXPR getNumbers() VAL [array={-3:0}, getNumbers()={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={-3:0}, i=0, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=0, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=0, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=0, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=0] [L18] ++i VAL [array={-3:0}, i=1, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=1, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=1, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=1, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=1] [L18] ++i VAL [array={-3:0}, i=2, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=2, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=2, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=2, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=2] [L18] ++i VAL [array={-3:0}, i=3, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=3, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=3, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=3, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=3] [L18] ++i VAL [array={-3:0}, i=4, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=4, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=4, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=4, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=4] [L18] ++i VAL [array={-3:0}, i=5, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=5, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=5, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=5, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=5] [L18] ++i VAL [array={-3:0}, i=6, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=6, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=6, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=6, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=6] [L18] ++i VAL [array={-3:0}, i=7, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=7, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=7, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=7, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=7] [L18] ++i VAL [array={-3:0}, i=8, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=8, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=8, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=8, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=8] [L18] ++i VAL [array={-3:0}, i=9, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND TRUE i < 10 VAL [array={-3:0}, i=9, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L19] EXPR numbers[i] VAL [array={-3:0}, i=9, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={-3:0}, i=9, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}, numbers[i]=9] [L18] ++i VAL [array={-3:0}, i=10, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L18] COND FALSE !(i < 10) VAL [array={-3:0}, i=10, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L21] return numbers2; VAL [\result={-1:0}, array={-3:0}, i=10, numbers={-3:0}, numbers2={-1:0}, numbers4={-4:0}] [L25] RET, EXPR getNumbers2() VAL [array={-3:0}, getNumbers2()={-1:0}, numbers2={-1:0}, numbers4={-4:0}] [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={-3:0}, i=0, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=0, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=0, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=0, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=0] [L27] ++i VAL [array={-3:0}, i=1, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=1, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=1, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=1, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=1] [L27] ++i VAL [array={-3:0}, i=2, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=2, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=2, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=2, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=2] [L27] ++i VAL [array={-3:0}, i=3, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=3, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=3, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=3, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=3] [L27] ++i VAL [array={-3:0}, i=4, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=4, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=4, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=4, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=4] [L27] ++i VAL [array={-3:0}, i=5, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=5, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=5, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=5, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=5] [L27] ++i VAL [array={-3:0}, i=6, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=6, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=6, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=6, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=6] [L27] ++i VAL [array={-3:0}, i=7, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=7, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=7, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=7, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=7] [L27] ++i VAL [array={-3:0}, i=8, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=8, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=8, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=8, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=8] [L27] ++i VAL [array={-3:0}, i=9, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND TRUE i < 10 VAL [array={-3:0}, i=9, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L28] EXPR numbers[i] VAL [array={-3:0}, i=9, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={-3:0}, i=9, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}, numbers[i]=9] [L27] ++i VAL [array={-3:0}, i=10, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L27] COND FALSE !(i < 10) VAL [array={-3:0}, i=10, numbers={-1:0}, numbers2={-1:0}, numbers3={-2:0}, numbers4={-4:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={-2:0}, array={-3:0}, i=10, numbers={-1:0}, numbers2={-1:0}, numbers4={-4:0}] [L35] RET, EXPR getNumbers3() VAL [array={-3:0}, getNumbers3()={-2:0}, numbers2={-1:0}, numbers4={-4:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={-3:0}, i=0, numbers={-2:0}, numbers2={-1:0}, numbers4={-4:0}] [L37] COND TRUE i < 10 VAL [array={-3:0}, i=0, numbers={-2:0}, numbers2={-1:0}, numbers4={-4:0}] [L38] numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. UNSAFE Result, 53.6s OverallTime, 30 OverallIterations, 10 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1632 SDtfs, 1010 SDslu, 8405 SDs, 0 SdLazy, 2038 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2334 GetRequests, 2059 SyntacticMatches, 5 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 77 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 22.4s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 4460 NumberOfCodeBlocks, 4143 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 4249 ConstructedInterpolants, 179 QuantifiedInterpolants, 1281575 SizeOfPredicates, 63 NumberOfNonLiveVariables, 8843 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 9289/12283 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...