./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 00:36:46,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:36:46,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:36:46,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:36:46,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:36:46,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:36:46,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:36:46,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:36:46,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:36:46,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:36:46,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:36:46,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:36:46,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:36:46,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:36:46,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:36:46,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:36:46,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:36:46,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:36:46,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:36:46,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:36:46,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:36:46,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:36:46,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:36:46,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:36:46,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:36:46,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:36:46,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:36:46,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:36:46,377 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:36:46,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:36:46,378 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:36:46,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:36:46,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:36:46,382 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:36:46,383 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:36:46,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:36:46,386 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:36:46,416 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:36:46,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:36:46,417 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:36:46,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:36:46,418 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:36:46,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:36:46,418 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:36:46,418 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:36:46,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:36:46,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:36:46,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:36:46,419 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:36:46,419 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:36:46,419 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:36:46,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:36:46,422 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:36:46,422 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:36:46,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:36:46,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:36:46,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:36:46,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:36:46,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:36:46,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:36:46,425 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:36:46,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:36:46,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:36:46,426 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 00:36:46,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:36:46,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:36:46,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:36:46,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:36:46,483 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:36:46,484 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2019-01-14 00:36:46,548 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285655142/3503b2f59e4e4d87b847703972ed17ef/FLAG87c28f9ec [2019-01-14 00:36:46,967 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:36:46,968 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2019-01-14 00:36:46,975 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285655142/3503b2f59e4e4d87b847703972ed17ef/FLAG87c28f9ec [2019-01-14 00:36:47,346 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285655142/3503b2f59e4e4d87b847703972ed17ef [2019-01-14 00:36:47,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:36:47,351 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:36:47,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:47,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:36:47,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:36:47,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6fe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47, skipping insertion in model container [2019-01-14 00:36:47,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:36:47,385 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:36:47,561 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:47,579 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:36:47,604 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:47,627 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:36:47,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47 WrapperNode [2019-01-14 00:36:47,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:47,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:36:47,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:36:47,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:36:47,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (1/1) ... [2019-01-14 00:36:47,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:36:47,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:36:47,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:36:47,683 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:36:47,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (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 00:36:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:36:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:36:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-14 00:36:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-14 00:36:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-01-14 00:36:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-01-14 00:36:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:36:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-14 00:36:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-14 00:36:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:36:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-14 00:36:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:36:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-01-14 00:36:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:36:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:36:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-01-14 00:36:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:36:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:36:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 00:36:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:36:48,433 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:36:48,434 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 00:36:48,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:48 BoogieIcfgContainer [2019-01-14 00:36:48,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:36:48,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:36:48,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:36:48,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:36:48,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:36:47" (1/3) ... [2019-01-14 00:36:48,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73608f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:48, skipping insertion in model container [2019-01-14 00:36:48,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:47" (2/3) ... [2019-01-14 00:36:48,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73608f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:48, skipping insertion in model container [2019-01-14 00:36:48,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:48" (3/3) ... [2019-01-14 00:36:48,444 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2019-01-14 00:36:48,452 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:36:48,460 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-14 00:36:48,477 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-14 00:36:48,504 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:36:48,505 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:36:48,505 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:36:48,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:36:48,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:36:48,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:36:48,506 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:36:48,506 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:36:48,506 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:36:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-14 00:36:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:36:48,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:48,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:48,540 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:48,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:48,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-01-14 00:36:48,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:48,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:48,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:48,784 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 00:36:48,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:48,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:48,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:48,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:48,805 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-01-14 00:36:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:49,057 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 00:36:49,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:49,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 00:36:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:49,074 INFO L225 Difference]: With dead ends: 69 [2019-01-14 00:36:49,075 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 00:36:49,077 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 00:36:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 00:36:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-14 00:36:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 00:36:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-01-14 00:36:49,135 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2019-01-14 00:36:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:49,135 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-01-14 00:36:49,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-01-14 00:36:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:36:49,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:49,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:49,137 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-01-14 00:36:49,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:49,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:49,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:49,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:49,325 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 00:36:49,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:49,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:36:49,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:36:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:36:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:36:49,328 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 4 states. [2019-01-14 00:36:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:49,753 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 00:36:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:36:49,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 00:36:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:49,757 INFO L225 Difference]: With dead ends: 69 [2019-01-14 00:36:49,757 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 00:36:49,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:36:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 00:36:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-14 00:36:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 00:36:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-01-14 00:36:49,769 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 12 [2019-01-14 00:36:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:49,770 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-01-14 00:36:49,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:36:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-01-14 00:36:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 00:36:49,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:49,772 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:49,772 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-01-14 00:36:49,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:49,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:49,956 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 00:36:49,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:49,957 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 00:36:49,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:50,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:50,080 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 00:36:50,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,089 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 00:36:50,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,117 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 00:36:50,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,143 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 00:36:50,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:50,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:50,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:50,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:50,673 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 00:36:50,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,784 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 00:36:50,903 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-14 00:36:50,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:50,936 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 00:36:51,044 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-01-14 00:36:51,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,066 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 00:36:51,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,151 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 00:36:51,151 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,183 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,234 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 00:36:51,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,333 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 00:36:51,334 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,345 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,356 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,388 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,423 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 00:36:51,424 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-14 00:36:51,715 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 00:36:51,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:51,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-14 00:36:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:36:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:36:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:51,746 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2019-01-14 00:36:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:52,032 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-01-14 00:36:52,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:36:52,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 00:36:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:52,037 INFO L225 Difference]: With dead ends: 72 [2019-01-14 00:36:52,037 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 00:36:52,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 00:36:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-01-14 00:36:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 00:36:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-14 00:36:52,047 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 15 [2019-01-14 00:36:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:52,047 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-14 00:36:52,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:36:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-14 00:36:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 00:36:52,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:52,049 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:52,050 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2019-01-14 00:36:52,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:52,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:52,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:52,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:52,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:52,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:52,529 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 00:36:52,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:52,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:36:52,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:52,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:52,591 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 00:36:52,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,597 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 00:36:52,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,611 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 00:36:52,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,636 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 00:36:52,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,751 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 00:36:52,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,779 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 00:36:52,919 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-14 00:36:52,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,940 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 00:36:53,050 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-01-14 00:36:53,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,073 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 00:36:53,074 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:53,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,121 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 00:36:53,122 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:53,142 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:53,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,200 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 00:36:53,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:53,257 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 00:36:53,258 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:53,271 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:53,283 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:53,291 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:53,309 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 00:36:53,311 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-14 00:36:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:53,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:36:53,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-14 00:36:53,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:36:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:36:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:36:53,888 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 13 states. [2019-01-14 00:36:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:54,856 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-14 00:36:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:36:54,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-01-14 00:36:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:54,860 INFO L225 Difference]: With dead ends: 75 [2019-01-14 00:36:54,860 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 00:36:54,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:36:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 00:36:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-14 00:36:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 00:36:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-01-14 00:36:54,869 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 18 [2019-01-14 00:36:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:54,869 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-01-14 00:36:54,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:36:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-01-14 00:36:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 00:36:54,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:54,870 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 00:36:54,871 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 502160116, now seen corresponding path program 1 times [2019-01-14 00:36:54,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:54,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:36:54,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:54,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:36:54,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:54,970 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 6 states. [2019-01-14 00:36:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:55,109 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-01-14 00:36:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:36:55,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-01-14 00:36:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:55,111 INFO L225 Difference]: With dead ends: 74 [2019-01-14 00:36:55,112 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 00:36:55,112 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 00:36:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 00:36:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 00:36:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 00:36:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-01-14 00:36:55,119 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 29 [2019-01-14 00:36:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:55,119 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-01-14 00:36:55,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-01-14 00:36:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 00:36:55,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:55,121 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 00:36:55,122 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:55,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:55,123 INFO L82 PathProgramCache]: Analyzing trace with hash 502160117, now seen corresponding path program 1 times [2019-01-14 00:36:55,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:55,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:55,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:55,220 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 00:36:55,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:55,220 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 00:36:55,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:55,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:55,383 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 00:36:55,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:55,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:36:55,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:36:55,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:36:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:55,433 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 8 states. [2019-01-14 00:36:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:55,588 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-01-14 00:36:55,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:36:55,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-14 00:36:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:55,590 INFO L225 Difference]: With dead ends: 79 [2019-01-14 00:36:55,590 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 00:36:55,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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 00:36:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 00:36:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-01-14 00:36:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:36:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-01-14 00:36:55,600 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2019-01-14 00:36:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:55,601 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-01-14 00:36:55,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:36:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-01-14 00:36:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 00:36:55,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:55,604 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] [2019-01-14 00:36:55,604 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2061034002, now seen corresponding path program 2 times [2019-01-14 00:36:55,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:55,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:55,761 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 00:36:55,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:55,761 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 00:36:55,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:55,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:36:55,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:55,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:55,832 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 00:36:55,968 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:36:55,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:55,990 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 00:36:56,110 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-14 00:36:56,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,117 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 34 treesize of output 47 [2019-01-14 00:36:56,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,157 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 32 [2019-01-14 00:36:56,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,237 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 00:36:56,358 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-01-14 00:36:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,373 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 00:36:56,374 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,500 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 00:36:56,501 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,526 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,581 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 00:36:56,584 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 00:36:56,589 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 00:36:56,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:56,593 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 00:36:56,595 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,611 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,621 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,629 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:56,651 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 00:36:56,652 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-14 00:36:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 00:36:56,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:36:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-14 00:36:56,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:36:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:36:56,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:36:56,916 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 13 states. [2019-01-14 00:36:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:57,514 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-14 00:36:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:36:57,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-01-14 00:36:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:57,517 INFO L225 Difference]: With dead ends: 82 [2019-01-14 00:36:57,518 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 00:36:57,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-14 00:36:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 00:36:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-14 00:36:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 00:36:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-01-14 00:36:57,527 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 32 [2019-01-14 00:36:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:57,528 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-01-14 00:36:57,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:36:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-01-14 00:36:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 00:36:57,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:57,531 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 00:36:57,532 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:57,533 INFO L82 PathProgramCache]: Analyzing trace with hash -428261789, now seen corresponding path program 1 times [2019-01-14 00:36:57,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:57,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:57,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:57,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:57,698 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 00:36:57,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:57,698 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 00:36:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:57,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:57,820 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 00:36:57,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:57,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 00:36:57,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:36:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:36:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:57,840 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 10 states. [2019-01-14 00:36:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:57,926 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-01-14 00:36:57,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:36:57,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-14 00:36:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:57,930 INFO L225 Difference]: With dead ends: 85 [2019-01-14 00:36:57,930 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 00:36:57,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 00:36:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-01-14 00:36:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 00:36:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-14 00:36:57,942 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 36 [2019-01-14 00:36:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:57,943 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-14 00:36:57,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:36:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-14 00:36:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 00:36:57,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:57,944 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 00:36:57,944 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:57,947 INFO L82 PathProgramCache]: Analyzing trace with hash 507961674, now seen corresponding path program 2 times [2019-01-14 00:36:57,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:57,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:58,224 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 00:36:58,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:58,224 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 00:36:58,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:58,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:36:58,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:58,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:58,291 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 50 treesize of output 46 [2019-01-14 00:36:58,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,330 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 46 treesize of output 46 [2019-01-14 00:36:58,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,399 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 2 case distinctions, treesize of input 43 treesize of output 60 [2019-01-14 00:36:58,517 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-01-14 00:36:58,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 70 [2019-01-14 00:36:58,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2019-01-14 00:36:58,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:58,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:58,743 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2019-01-14 00:36:58,745 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 00:36:58,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:36:59,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,019 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 00:36:59,060 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 00:36:59,060 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:59,085 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:59,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 00:36:59,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,317 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 41 treesize of output 50 [2019-01-14 00:36:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:59,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-14 00:36:59,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2019-01-14 00:36:59,378 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:59,395 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:59,417 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:59,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 00:36:59,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 00:36:59,748 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 00:36:59,749 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:50, output treesize:214 [2019-01-14 00:36:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-14 00:37:00,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:00,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2019-01-14 00:37:00,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:37:00,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:37:00,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:00,008 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 11 states. [2019-01-14 00:37:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:00,598 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-01-14 00:37:00,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:37:00,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-14 00:37:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:00,600 INFO L225 Difference]: With dead ends: 87 [2019-01-14 00:37:00,600 INFO L226 Difference]: Without dead ends: 87 [2019-01-14 00:37:00,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:37:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-14 00:37:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-01-14 00:37:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 00:37:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-01-14 00:37:00,608 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2019-01-14 00:37:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:00,608 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-01-14 00:37:00,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:37:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-01-14 00:37:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 00:37:00,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:00,618 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 00:37:00,618 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:00,618 INFO L82 PathProgramCache]: Analyzing trace with hash 23527684, now seen corresponding path program 1 times [2019-01-14 00:37:00,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:00,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:00,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:00,814 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 00:37:00,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:00,815 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 00:37:00,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:00,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:00,887 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 00:37:00,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:00,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:37:00,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:37:00,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:37:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:00,909 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 12 states. [2019-01-14 00:37:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:00,994 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-01-14 00:37:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:37:00,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-01-14 00:37:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:00,996 INFO L225 Difference]: With dead ends: 90 [2019-01-14 00:37:00,996 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 00:37:00,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 00:37:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-01-14 00:37:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 00:37:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-01-14 00:37:01,004 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 42 [2019-01-14 00:37:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:01,005 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-01-14 00:37:01,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:37:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-01-14 00:37:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 00:37:01,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:01,006 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] [2019-01-14 00:37:01,006 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:01,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -659383637, now seen corresponding path program 2 times [2019-01-14 00:37:01,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:01,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:01,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:01,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:01,146 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 00:37:01,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:01,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:01,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:01,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:01,198 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 00:37:01,203 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 18 treesize of output 20 [2019-01-14 00:37:01,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,216 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 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-14 00:37:01,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 47 [2019-01-14 00:37:01,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,291 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 32 treesize of output 31 [2019-01-14 00:37:01,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,303 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 31 treesize of output 34 [2019-01-14 00:37:01,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,385 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 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-14 00:37:01,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 00:37:01,486 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,524 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 25 treesize of output 25 [2019-01-14 00:37:01,525 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,541 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,567 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 26 treesize of output 38 [2019-01-14 00:37:01,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:01,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-14 00:37:01,601 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,638 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,648 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:01,667 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 00:37:01,668 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:50, output treesize:32 [2019-01-14 00:37:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 00:37:01,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:01,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2019-01-14 00:37:01,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 00:37:01,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 00:37:01,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-14 00:37:01,913 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 15 states. [2019-01-14 00:37:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:02,467 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-01-14 00:37:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:37:02,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-01-14 00:37:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:02,470 INFO L225 Difference]: With dead ends: 90 [2019-01-14 00:37:02,470 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 00:37:02,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-01-14 00:37:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 00:37:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-14 00:37:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 00:37:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-01-14 00:37:02,476 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 45 [2019-01-14 00:37:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-01-14 00:37:02,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 00:37:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-01-14 00:37:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 00:37:02,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:02,479 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 00:37:02,479 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -590033308, now seen corresponding path program 1 times [2019-01-14 00:37:02,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:02,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:02,617 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 00:37:02,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:02,618 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 00:37:02,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:02,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:02,822 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 00:37:02,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:02,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 00:37:02,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:37:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:37:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:02,858 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states. [2019-01-14 00:37:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:03,057 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-01-14 00:37:03,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:37:03,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-14 00:37:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:03,062 INFO L225 Difference]: With dead ends: 99 [2019-01-14 00:37:03,062 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 00:37:03,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 00:37:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-01-14 00:37:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 00:37:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-14 00:37:03,068 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 57 [2019-01-14 00:37:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:03,068 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-14 00:37:03,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:37:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-14 00:37:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 00:37:03,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:03,075 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 00:37:03,075 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash -317183978, now seen corresponding path program 2 times [2019-01-14 00:37:03,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:03,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:03,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:03,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:03,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:03,179 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 00:37:03,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:03,180 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 00:37:03,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:03,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:03,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:03,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:03,228 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 00:37:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:03,240 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 00:37:03,250 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 00:37:03,259 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 00:37:03,266 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 00:37:03,267 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:03,275 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:03,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:03,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:03,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:03,316 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 00:37:03,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:03,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:03,335 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 29 treesize of output 39 [2019-01-14 00:37:03,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:03,381 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 35 treesize of output 42 [2019-01-14 00:37:03,383 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 00:37:03,444 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 00:37:03,445 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:03,492 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:37:03,549 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 00:37:03,559 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 00:37:03,560 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:03,573 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:03,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 00:37:03,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 00:37:03,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 00:37:03,785 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 00:37:03,786 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:18, output treesize:114 [2019-01-14 00:37:04,151 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 00:37:04,349 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 00:37:04,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:04,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:04,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:04,375 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 00:37:04,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:37:04,401 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 00:37:04,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:48 [2019-01-14 00:37:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-14 00:37:04,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:04,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-14 00:37:04,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:37:04,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:37:04,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:04,467 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 9 states. [2019-01-14 00:37:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:04,805 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-01-14 00:37:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:37:04,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-01-14 00:37:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:04,808 INFO L225 Difference]: With dead ends: 103 [2019-01-14 00:37:04,808 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 00:37:04,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:37:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 00:37:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-14 00:37:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 00:37:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-01-14 00:37:04,812 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 62 [2019-01-14 00:37:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:04,813 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-01-14 00:37:04,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:37:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-01-14 00:37:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 00:37:04,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:04,814 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 00:37:04,814 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:04,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1648161371, now seen corresponding path program 1 times [2019-01-14 00:37:04,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:04,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:04,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:04,918 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 00:37:04,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:04,919 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 00:37:04,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:04,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:04,995 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 00:37:05,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:05,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 00:37:05,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:37:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:37:05,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:05,016 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 7 states. [2019-01-14 00:37:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:05,049 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-01-14 00:37:05,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:05,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-14 00:37:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:05,052 INFO L225 Difference]: With dead ends: 108 [2019-01-14 00:37:05,052 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 00:37:05,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 00:37:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-01-14 00:37:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:37:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-01-14 00:37:05,056 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 67 [2019-01-14 00:37:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:05,057 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-01-14 00:37:05,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:37:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-01-14 00:37:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 00:37:05,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:05,061 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] [2019-01-14 00:37:05,061 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:05,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2138009815, now seen corresponding path program 2 times [2019-01-14 00:37:05,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:05,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:05,174 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 00:37:05,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:05,175 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 00:37:05,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:05,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:05,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:05,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:05,222 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 32 treesize of output 31 [2019-01-14 00:37:05,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,243 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 31 treesize of output 34 [2019-01-14 00:37:05,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,283 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 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-14 00:37:05,414 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-01-14 00:37:05,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,467 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 00:37:05,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 00:37:05,533 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,600 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 26 treesize of output 38 [2019-01-14 00:37:05,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-14 00:37:05,658 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,675 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 00:37:05,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-14 00:37:05,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-14 00:37:05,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:05,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 47 [2019-01-14 00:37:05,768 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,794 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,805 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,816 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:05,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 00:37:05,842 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:50, output treesize:32 [2019-01-14 00:37:06,207 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 00:37:06,469 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 00:37:06,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:06,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:06,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:06,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:06,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 50 [2019-01-14 00:37:06,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 00:37:06,580 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 00:37:06,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:88 [2019-01-14 00:37:06,792 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 00:37:06,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:06,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-14 00:37:06,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:37:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:37:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:06,811 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 12 states. [2019-01-14 00:37:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:07,325 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-14 00:37:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:37:07,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-01-14 00:37:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:07,327 INFO L225 Difference]: With dead ends: 113 [2019-01-14 00:37:07,327 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 00:37:07,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-01-14 00:37:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 00:37:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-01-14 00:37:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 00:37:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-01-14 00:37:07,331 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 72 [2019-01-14 00:37:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:07,331 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-01-14 00:37:07,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:37:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-01-14 00:37:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 00:37:07,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:07,332 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 00:37:07,337 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1123262533, now seen corresponding path program 1 times [2019-01-14 00:37:07,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:07,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:07,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:07,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:07,403 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 00:37:07,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:07,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:37:07,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:37:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:37:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:07,405 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 3 states. [2019-01-14 00:37:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:07,442 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-01-14 00:37:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:37:07,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-01-14 00:37:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:07,445 INFO L225 Difference]: With dead ends: 108 [2019-01-14 00:37:07,445 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 00:37:07,446 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 00:37:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 00:37:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 00:37:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 00:37:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-01-14 00:37:07,449 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 78 [2019-01-14 00:37:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:07,449 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-01-14 00:37:07,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:37:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-01-14 00:37:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 00:37:07,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:07,453 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 00:37:07,453 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1123262532, now seen corresponding path program 1 times [2019-01-14 00:37:07,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:07,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:07,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:07,635 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 00:37:07,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:07,636 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 00:37:07,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:07,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:07,718 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 00:37:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 00:37:07,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:37:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:37:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:07,737 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 9 states. [2019-01-14 00:37:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:07,784 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-14 00:37:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:37:07,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-01-14 00:37:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:07,787 INFO L225 Difference]: With dead ends: 117 [2019-01-14 00:37:07,787 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 00:37:07,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 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 00:37:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 00:37:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-01-14 00:37:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 00:37:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-01-14 00:37:07,794 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 78 [2019-01-14 00:37:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:07,794 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-01-14 00:37:07,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:37:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-01-14 00:37:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 00:37:07,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:07,798 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] [2019-01-14 00:37:07,798 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1954125494, now seen corresponding path program 2 times [2019-01-14 00:37:07,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:07,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:07,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:07,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:07,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:37:08,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:08,114 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 00:37:08,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:08,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:08,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:08,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:08,177 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 00:37:08,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:08,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:08,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 00:37:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-01-14 00:37:08,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:08,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-01-14 00:37:08,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:37:08,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:37:08,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:08,233 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 11 states. [2019-01-14 00:37:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:08,355 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2019-01-14 00:37:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:37:08,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-01-14 00:37:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:08,358 INFO L225 Difference]: With dead ends: 121 [2019-01-14 00:37:08,358 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 00:37:08,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 00:37:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-14 00:37:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 00:37:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-01-14 00:37:08,363 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 83 [2019-01-14 00:37:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:08,363 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-01-14 00:37:08,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:37:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-01-14 00:37:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 00:37:08,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:08,365 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 00:37:08,365 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash 283421384, now seen corresponding path program 1 times [2019-01-14 00:37:08,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:08,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:08,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:08,510 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 00:37:08,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:08,511 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 00:37:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:08,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:08,594 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 00:37:08,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:08,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 00:37:08,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:37:08,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:37:08,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:08,615 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 11 states. [2019-01-14 00:37:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:08,682 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-01-14 00:37:08,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:37:08,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-01-14 00:37:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:08,685 INFO L225 Difference]: With dead ends: 126 [2019-01-14 00:37:08,686 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 00:37:08,686 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 00:37:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 00:37:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-01-14 00:37:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 00:37:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2019-01-14 00:37:08,690 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 97 [2019-01-14 00:37:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:08,691 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2019-01-14 00:37:08,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:37:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2019-01-14 00:37:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 00:37:08,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:08,695 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 00:37:08,695 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:08,695 INFO L82 PathProgramCache]: Analyzing trace with hash -663164294, now seen corresponding path program 2 times [2019-01-14 00:37:08,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:08,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:08,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:08,863 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 00:37:08,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:08,864 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 00:37:08,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:08,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:37:08,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:08,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:08,962 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 00:37:08,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:08,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:37:08,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:37:08,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:37:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:08,991 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 12 states. [2019-01-14 00:37:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:09,099 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-14 00:37:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:37:09,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2019-01-14 00:37:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:09,102 INFO L225 Difference]: With dead ends: 131 [2019-01-14 00:37:09,102 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 00:37:09,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 00:37:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-01-14 00:37:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 00:37:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-01-14 00:37:09,106 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 102 [2019-01-14 00:37:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:09,107 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-01-14 00:37:09,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:37:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-01-14 00:37:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-14 00:37:09,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:09,108 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-01-14 00:37:09,108 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1584572936, now seen corresponding path program 3 times [2019-01-14 00:37:09,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:09,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:09,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:09,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:37:09,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:09,517 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 00:37:09,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:37:09,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 00:37:09,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:09,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-14 00:37:09,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:09,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-01-14 00:37:09,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 00:37:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 00:37:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:37:09,634 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 14 states. [2019-01-14 00:37:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:09,736 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2019-01-14 00:37:09,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:37:09,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-01-14 00:37:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:09,739 INFO L225 Difference]: With dead ends: 141 [2019-01-14 00:37:09,739 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 00:37:09,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:37:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 00:37:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-01-14 00:37:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-14 00:37:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-01-14 00:37:09,743 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 107 [2019-01-14 00:37:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:09,744 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-01-14 00:37:09,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 00:37:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-01-14 00:37:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-14 00:37:09,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:09,747 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 00:37:09,747 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:09,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:09,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1387314960, now seen corresponding path program 4 times [2019-01-14 00:37:09,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:09,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:09,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:09,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:09,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:10,010 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 00:37:10,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:10,010 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 00:37:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 00:37:10,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 00:37:10,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:10,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:10,301 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 00:37:10,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:10,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 00:37:10,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:37:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:37:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:10,351 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 6 states. [2019-01-14 00:37:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:10,611 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2019-01-14 00:37:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:37:10,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-01-14 00:37:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:10,619 INFO L225 Difference]: With dead ends: 146 [2019-01-14 00:37:10,619 INFO L226 Difference]: Without dead ends: 146 [2019-01-14 00:37:10,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-14 00:37:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2019-01-14 00:37:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-14 00:37:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2019-01-14 00:37:10,639 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 117 [2019-01-14 00:37:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:10,639 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2019-01-14 00:37:10,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:37:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2019-01-14 00:37:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-14 00:37:10,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:10,647 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 00:37:10,648 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash -575903494, now seen corresponding path program 5 times [2019-01-14 00:37:10,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:10,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:10,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:11,093 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 00:37:11,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:11,094 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 00:37:11,112 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 00:37:14,093 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 00:37:14,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:14,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:14,154 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 00:37:14,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:14,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 00:37:14,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:37:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:37:14,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:14,189 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand 7 states. [2019-01-14 00:37:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:14,253 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2019-01-14 00:37:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:14,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2019-01-14 00:37:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:14,256 INFO L225 Difference]: With dead ends: 151 [2019-01-14 00:37:14,256 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 00:37:14,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 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 00:37:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 00:37:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-01-14 00:37:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-14 00:37:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-01-14 00:37:14,261 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 122 [2019-01-14 00:37:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:14,261 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-01-14 00:37:14,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:37:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-01-14 00:37:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-14 00:37:14,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:14,262 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 00:37:14,262 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash -371170992, now seen corresponding path program 6 times [2019-01-14 00:37:14,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:14,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:14,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:14,440 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 00:37:14,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:14,441 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 00:37:14,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 00:37:15,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 00:37:15,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:15,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:15,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 00:37:15,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:15,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:37:15,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:37:15,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:37:15,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:37:15,390 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 8 states. [2019-01-14 00:37:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:15,433 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2019-01-14 00:37:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:37:15,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2019-01-14 00:37:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:15,437 INFO L225 Difference]: With dead ends: 156 [2019-01-14 00:37:15,438 INFO L226 Difference]: Without dead ends: 156 [2019-01-14 00:37:15,438 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 00:37:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-14 00:37:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-01-14 00:37:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-14 00:37:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-01-14 00:37:15,444 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 127 [2019-01-14 00:37:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:15,445 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-01-14 00:37:15,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:37:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-01-14 00:37:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-14 00:37:15,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:15,450 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 00:37:15,450 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1244147386, now seen corresponding path program 7 times [2019-01-14 00:37:15,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:15,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:15,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:15,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:15,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:15,592 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 00:37:15,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:15,593 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 00:37:15,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:15,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:15,690 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 00:37:15,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:15,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 00:37:15,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:37:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:37:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:15,709 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 9 states. [2019-01-14 00:37:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:15,786 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-14 00:37:15,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:37:15,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-01-14 00:37:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:15,791 INFO L225 Difference]: With dead ends: 161 [2019-01-14 00:37:15,791 INFO L226 Difference]: Without dead ends: 161 [2019-01-14 00:37:15,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-14 00:37:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2019-01-14 00:37:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 00:37:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-01-14 00:37:15,800 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 132 [2019-01-14 00:37:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:15,800 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-01-14 00:37:15,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:37:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-01-14 00:37:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-14 00:37:15,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:15,801 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 00:37:15,802 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:15,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2070269040, now seen corresponding path program 8 times [2019-01-14 00:37:15,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:15,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:15,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:16,144 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 00:37:16,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:16,144 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 00:37:16,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:16,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:37:16,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:16,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:16,258 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 00:37:16,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:16,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 00:37:16,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:37:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:37:16,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:37:16,278 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 10 states. [2019-01-14 00:37:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:16,334 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-01-14 00:37:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:37:16,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2019-01-14 00:37:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:16,337 INFO L225 Difference]: With dead ends: 166 [2019-01-14 00:37:16,337 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 00:37:16,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 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 00:37:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 00:37:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-01-14 00:37:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-14 00:37:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2019-01-14 00:37:16,341 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 137 [2019-01-14 00:37:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:16,342 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2019-01-14 00:37:16,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:37:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2019-01-14 00:37:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-14 00:37:16,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:16,343 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 00:37:16,343 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1106756730, now seen corresponding path program 9 times [2019-01-14 00:37:16,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:16,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:16,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:17,401 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 00:37:17,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:17,402 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 00:37:17,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:37:18,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-14 00:37:18,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:18,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:18,283 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 00:37:18,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:18,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 00:37:18,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:37:18,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:37:18,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:18,329 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand 11 states. [2019-01-14 00:37:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:18,447 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2019-01-14 00:37:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:37:18,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2019-01-14 00:37:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:18,450 INFO L225 Difference]: With dead ends: 171 [2019-01-14 00:37:18,450 INFO L226 Difference]: Without dead ends: 171 [2019-01-14 00:37:18,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-14 00:37:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-01-14 00:37:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-14 00:37:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-01-14 00:37:18,456 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 142 [2019-01-14 00:37:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:18,458 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-01-14 00:37:18,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:37:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-01-14 00:37:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-14 00:37:18,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:18,462 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 00:37:18,462 INFO L423 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1612565040, now seen corresponding path program 10 times [2019-01-14 00:37:18,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:18,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:18,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:18,849 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 00:37:18,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:18,849 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 00:37:18,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 00:37:19,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 00:37:19,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:19,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:19,813 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 00:37:19,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:19,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:37:19,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:37:19,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:37:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:19,834 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 12 states. [2019-01-14 00:37:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:19,929 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2019-01-14 00:37:19,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:37:19,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2019-01-14 00:37:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:19,932 INFO L225 Difference]: With dead ends: 176 [2019-01-14 00:37:19,932 INFO L226 Difference]: Without dead ends: 176 [2019-01-14 00:37:19,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-14 00:37:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2019-01-14 00:37:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-14 00:37:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2019-01-14 00:37:19,942 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 147 [2019-01-14 00:37:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:19,943 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2019-01-14 00:37:19,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:37:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2019-01-14 00:37:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-14 00:37:19,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:19,945 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 00:37:19,945 INFO L423 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash -896062918, now seen corresponding path program 11 times [2019-01-14 00:37:19,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:19,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:19,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:20,240 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 00:37:20,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:20,241 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 00:37:20,251 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 00:37:50,796 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 00:37:50,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:50,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:50,927 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 00:37:50,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:50,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 00:37:50,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:37:50,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:37:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:50,971 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand 13 states. [2019-01-14 00:37:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:51,617 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2019-01-14 00:37:51,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:37:51,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 152 [2019-01-14 00:37:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:51,624 INFO L225 Difference]: With dead ends: 177 [2019-01-14 00:37:51,624 INFO L226 Difference]: Without dead ends: 177 [2019-01-14 00:37:51,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-14 00:37:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-14 00:37:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-14 00:37:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-01-14 00:37:51,634 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 152 [2019-01-14 00:37:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:51,634 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-01-14 00:37:51,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:37:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-01-14 00:37:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-14 00:37:51,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:51,641 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 00:37:51,641 INFO L423 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1136420880, now seen corresponding path program 12 times [2019-01-14 00:37:51,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:51,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:51,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:37:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:37:52,204 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 00:37:52,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:37:52 BoogieIcfgContainer [2019-01-14 00:37:52,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:37:52,364 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:37:52,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:37:52,365 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:37:52,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:48" (3/4) ... [2019-01-14 00:37:52,372 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 00:37:52,486 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:37:52,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:37:52,492 INFO L168 Benchmark]: Toolchain (without parser) took 65140.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 248.1 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:52,493 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:37:52,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.83 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:52,493 INFO L168 Benchmark]: Boogie Preprocessor took 52.96 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:52,495 INFO L168 Benchmark]: RCFGBuilder took 752.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:52,496 INFO L168 Benchmark]: TraceAbstraction took 63927.06 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 281.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.6 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:52,496 INFO L168 Benchmark]: Witness Printer took 125.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:37:52,502 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.83 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.96 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 752.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63927.06 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 281.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.6 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. * Witness Printer took 125.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. 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={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L35] CALL, EXPR getNumbers3() VAL [array={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L25] CALL, EXPR getNumbers2() VAL [array={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L16] CALL, EXPR getNumbers() VAL [array={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L8] int i = 0; VAL [array={-4:0}, i=0, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=0, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=0, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=1, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=1, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=1, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=2, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=2, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=2, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=3, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=3, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=3, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=4, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=4, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=4, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=5, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=5, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=5, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=6, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=6, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=6, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=7, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=7, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=7, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=8, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=8, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=8, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=9, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-4:0}, i=9, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-4:0}, i=9, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-4:0}, i=10, numbers2={-2:0}, numbers4={-3:0}] [L8] COND FALSE !(i < 10) VAL [array={-4:0}, i=10, numbers2={-2:0}, numbers4={-3:0}] [L12] return array; VAL [\result={-4:0}, array={-4:0}, i=10, numbers2={-2:0}, numbers4={-3:0}] [L16] RET, EXPR getNumbers() VAL [array={-4:0}, getNumbers()={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={-4:0}, i=0, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=0, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=0, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=0, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=0] [L18] ++i VAL [array={-4:0}, i=1, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=1, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=1, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=1, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=1] [L18] ++i VAL [array={-4:0}, i=2, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=2, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=2, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=2, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=2] [L18] ++i VAL [array={-4:0}, i=3, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=3, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=3, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=3, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=3] [L18] ++i VAL [array={-4:0}, i=4, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=4, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=4, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=4, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=4] [L18] ++i VAL [array={-4:0}, i=5, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=5, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=5, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=5, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=5] [L18] ++i VAL [array={-4:0}, i=6, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=6, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=6, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=6, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=6] [L18] ++i VAL [array={-4:0}, i=7, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=7, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=7, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=7, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=7] [L18] ++i VAL [array={-4:0}, i=8, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=8, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=8, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=8, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=8] [L18] ++i VAL [array={-4:0}, i=9, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-4:0}, i=9, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-4:0}, i=9, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={-4:0}, i=9, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=9] [L18] ++i VAL [array={-4:0}, i=10, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND FALSE !(i < 10) VAL [array={-4:0}, i=10, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L21] return numbers2; VAL [\result={-2:0}, array={-4:0}, i=10, numbers={-4:0}, numbers2={-2:0}, numbers4={-3:0}] [L25] RET, EXPR getNumbers2() VAL [array={-4:0}, getNumbers2()={-2:0}, numbers2={-2:0}, numbers4={-3:0}] [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={-4:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=0] [L27] ++i VAL [array={-4:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=1] [L27] ++i VAL [array={-4:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=2] [L27] ++i VAL [array={-4:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=3] [L27] ++i VAL [array={-4:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=4] [L27] ++i VAL [array={-4:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=5] [L27] ++i VAL [array={-4:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=6] [L27] ++i VAL [array={-4:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=7] [L27] ++i VAL [array={-4:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=8] [L27] ++i VAL [array={-4:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-4:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-4:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={-4:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}, numbers[i]=9] [L27] ++i VAL [array={-4:0}, i=10, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L27] COND FALSE !(i < 10) VAL [array={-4:0}, i=10, numbers={-2:0}, numbers2={-2:0}, numbers3={-1:0}, numbers4={-3:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={-1:0}, array={-4:0}, i=10, numbers={-2:0}, numbers2={-2:0}, numbers4={-3:0}] [L35] RET, EXPR getNumbers3() VAL [array={-4:0}, getNumbers3()={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={-4:0}, i=0, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L37] COND TRUE i < 10 VAL [array={-4:0}, i=0, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L38] numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. UNSAFE Result, 63.8s OverallTime, 30 OverallIterations, 10 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1628 SDtfs, 948 SDslu, 7081 SDs, 0 SdLazy, 1965 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2308 GetRequests, 2047 SyntacticMatches, 4 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 9.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.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 76 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 37.4s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 4402 NumberOfCodeBlocks, 4082 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 4191 ConstructedInterpolants, 209 QuantifiedInterpolants, 1148902 SizeOfPredicates, 66 NumberOfNonLiveVariables, 7405 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 54 InterpolantComputations, 11 PerfectInterpolantSequences, 9457/12288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...