./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 2e94e6aa 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-2e94e6a [2019-01-01 19:54:06,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:54:06,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:54:06,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:54:06,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:54:06,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:54:06,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:54:06,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:54:06,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:54:06,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:54:06,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:54:06,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:54:06,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:54:06,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:54:06,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:54:06,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:54:06,771 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:54:06,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:54:06,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:54:06,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:54:06,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:54:06,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:54:06,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:54:06,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:54:06,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:54:06,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:54:06,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:54:06,795 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:54:06,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:54:06,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:54:06,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:54:06,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:54:06,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:54:06,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:54:06,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:54:06,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:54:06,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:54:06,828 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:54:06,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:54:06,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:54:06,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:54:06,830 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:54:06,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:54:06,830 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:54:06,831 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:54:06,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:54:06,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:54:06,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:54:06,831 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:54:06,831 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:54:06,831 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:54:06,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:54:06,833 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:54:06,833 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:54:06,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:54:06,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:54:06,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:54:06,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:54:06,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:54:06,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:54:06,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:54:06,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:54:06,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:54:06,836 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-01 19:54:06,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:54:06,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:54:06,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:54:06,893 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:54:06,893 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:54:06,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2019-01-01 19:54:06,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082da49db/f04ad8bf7e1a4b30a49caf27cccf4ca5/FLAGecc92a703 [2019-01-01 19:54:07,415 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:54:07,416 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2019-01-01 19:54:07,422 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082da49db/f04ad8bf7e1a4b30a49caf27cccf4ca5/FLAGecc92a703 [2019-01-01 19:54:07,767 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082da49db/f04ad8bf7e1a4b30a49caf27cccf4ca5 [2019-01-01 19:54:07,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:54:07,776 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:54:07,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:54:07,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:54:07,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:54:07,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:54:07" (1/1) ... [2019-01-01 19:54:07,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a975e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:07, skipping insertion in model container [2019-01-01 19:54:07,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:54:07" (1/1) ... [2019-01-01 19:54:07,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:54:07,821 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:54:08,054 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:54:08,074 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:54:08,097 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:54:08,121 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:54:08,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08 WrapperNode [2019-01-01 19:54:08,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:54:08,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:54:08,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:54:08,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:54:08,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (1/1) ... [2019-01-01 19:54:08,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (1/1) ... [2019-01-01 19:54:08,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (1/1) ... [2019-01-01 19:54:08,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (1/1) ... [2019-01-01 19:54:08,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (1/1) ... [2019-01-01 19:54:08,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (1/1) ... [2019-01-01 19:54:08,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (1/1) ... [2019-01-01 19:54:08,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:54:08,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:54:08,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:54:08,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:54:08,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (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-01 19:54:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:54:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:54:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-01 19:54:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-01 19:54:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-01-01 19:54:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-01-01 19:54:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:54:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-01 19:54:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-01 19:54:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:54:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-01 19:54:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:54:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-01-01 19:54:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 19:54:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:54:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-01-01 19:54:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:54:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:54:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 19:54:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:54:09,050 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:54:09,051 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 19:54:09,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:09 BoogieIcfgContainer [2019-01-01 19:54:09,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:54:09,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:54:09,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:54:09,059 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:54:09,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:54:07" (1/3) ... [2019-01-01 19:54:09,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d571b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:54:09, skipping insertion in model container [2019-01-01 19:54:09,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:08" (2/3) ... [2019-01-01 19:54:09,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d571b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:54:09, skipping insertion in model container [2019-01-01 19:54:09,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:09" (3/3) ... [2019-01-01 19:54:09,063 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2019-01-01 19:54:09,071 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:54:09,079 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-01 19:54:09,093 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-01 19:54:09,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:54:09,119 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:54:09,119 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:54:09,119 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:54:09,119 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:54:09,120 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:54:09,120 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:54:09,120 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:54:09,120 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:54:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-01 19:54:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:54:09,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:09,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:09,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:09,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-01-01 19:54:09,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:09,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:09,440 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-01 19:54:09,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:09,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:54:09,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:54:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:54:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:54:09,465 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-01-01 19:54:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:09,774 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-01 19:54:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:54:09,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 19:54:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:09,786 INFO L225 Difference]: With dead ends: 69 [2019-01-01 19:54:09,786 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 19:54:09,788 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-01 19:54:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 19:54:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-01 19:54:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 19:54:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-01-01 19:54:09,829 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2019-01-01 19:54:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:09,829 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-01-01 19:54:09,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:54:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-01-01 19:54:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:54:09,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:09,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:09,831 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:09,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-01-01 19:54:09,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:09,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:09,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:09,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:10,039 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-01 19:54:10,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:10,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 19:54:10,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:54:10,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:54:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:54:10,043 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 4 states. [2019-01-01 19:54:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:10,526 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-01 19:54:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:54:10,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-01 19:54:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:10,529 INFO L225 Difference]: With dead ends: 69 [2019-01-01 19:54:10,529 INFO L226 Difference]: Without dead ends: 69 [2019-01-01 19:54:10,530 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-01 19:54:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-01 19:54:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-01 19:54:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 19:54:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-01-01 19:54:10,540 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 12 [2019-01-01 19:54:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:10,540 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-01-01 19:54:10,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:54:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-01-01 19:54:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 19:54:10,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:10,541 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:10,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-01-01 19:54:10,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:10,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:10,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:10,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:10,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:10,830 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-01 19:54:10,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:10,831 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-01 19:54:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:10,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:10,956 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-01 19:54:10,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:10,970 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-01 19:54:10,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,013 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-01 19:54:11,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,036 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-01 19:54:11,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:11,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:11,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:11,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:11,352 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-01 19:54:11,495 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:54:11,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,621 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-01 19:54:11,737 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-01 19:54:11,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,786 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-01 19:54:11,896 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-01-01 19:54:11,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,913 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-01 19:54:11,914 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:11,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,996 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-01 19:54:11,997 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,022 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,080 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-01 19:54:12,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,191 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-01 19:54:12,191 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,208 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,219 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,251 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,287 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-01 19:54:12,288 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-01 19:54:12,485 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-01 19:54:12,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:12,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-01 19:54:12,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:54:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:54:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:12,521 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2019-01-01 19:54:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:12,836 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-01-01 19:54:12,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:12,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 19:54:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:12,840 INFO L225 Difference]: With dead ends: 72 [2019-01-01 19:54:12,840 INFO L226 Difference]: Without dead ends: 72 [2019-01-01 19:54:12,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-01 19:54:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-01-01 19:54:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 19:54:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-01 19:54:12,850 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 15 [2019-01-01 19:54:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:12,850 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-01 19:54:12,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:54:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-01 19:54:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 19:54:12,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:12,852 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:12,852 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2019-01-01 19:54:12,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:13,324 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-01 19:54:13,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:13,325 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-01 19:54:13,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:13,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:54:13,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:13,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:13,391 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-01 19:54:13,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,402 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-01 19:54:13,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,412 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-01 19:54:13,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,427 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-01 19:54:13,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,535 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-01 19:54:13,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,568 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-01 19:54:13,732 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-01 19:54:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,777 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-01 19:54:13,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,885 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-01 19:54:13,886 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:13,932 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-01 19:54:13,933 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,952 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:14,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:14,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:14,035 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-01 19:54:14,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:14,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:14,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:14,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:14,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:14,094 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-01 19:54:14,095 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:14,113 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:14,138 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:14,150 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:14,177 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-01 19:54:14,178 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-01 19:54:14,583 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-01 19:54:14,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-01 19:54:14,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:54:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:54:14,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:14,614 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 13 states. [2019-01-01 19:54:15,258 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-01-01 19:54:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:15,796 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-01 19:54:15,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:54:15,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-01-01 19:54:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:15,800 INFO L225 Difference]: With dead ends: 75 [2019-01-01 19:54:15,800 INFO L226 Difference]: Without dead ends: 75 [2019-01-01 19:54:15,801 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-01 19:54:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-01 19:54:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-01 19:54:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-01 19:54:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-01-01 19:54:15,808 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 18 [2019-01-01 19:54:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:15,808 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-01-01 19:54:15,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:54:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-01-01 19:54:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 19:54:15,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:15,809 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-01 19:54:15,809 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 502160116, now seen corresponding path program 1 times [2019-01-01 19:54:15,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:15,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:15,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:15,893 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-01 19:54:15,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:15,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:54:15,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:54:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:54:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:15,895 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 6 states. [2019-01-01 19:54:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:16,031 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-01-01 19:54:16,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:16,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-01-01 19:54:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:16,033 INFO L225 Difference]: With dead ends: 74 [2019-01-01 19:54:16,033 INFO L226 Difference]: Without dead ends: 74 [2019-01-01 19:54:16,034 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-01 19:54:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-01 19:54:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-01 19:54:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-01 19:54:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-01-01 19:54:16,040 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 29 [2019-01-01 19:54:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:16,041 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-01-01 19:54:16,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:54:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-01-01 19:54:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 19:54:16,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:16,042 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-01 19:54:16,042 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash 502160117, now seen corresponding path program 1 times [2019-01-01 19:54:16,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:16,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:16,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:16,154 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-01 19:54:16,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:16,155 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-01 19:54:16,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:16,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:16,268 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-01 19:54:16,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:16,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 19:54:16,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:54:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:54:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:16,289 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 8 states. [2019-01-01 19:54:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:16,377 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-01-01 19:54:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:54:16,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-01 19:54:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:16,380 INFO L225 Difference]: With dead ends: 79 [2019-01-01 19:54:16,380 INFO L226 Difference]: Without dead ends: 79 [2019-01-01 19:54:16,380 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-01 19:54:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-01 19:54:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-01-01 19:54:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 19:54:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-01-01 19:54:16,390 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2019-01-01 19:54:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:16,391 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-01-01 19:54:16,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:54:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-01-01 19:54:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 19:54:16,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:16,392 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-01 19:54:16,393 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2061034002, now seen corresponding path program 2 times [2019-01-01 19:54:16,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:16,519 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-01 19:54:16,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:16,519 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-01 19:54:16,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:16,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:16,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:16,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:16,600 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-01 19:54:16,731 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:54:16,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,762 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-01 19:54:16,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,868 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-01 19:54:16,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,923 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-01 19:54:16,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:16,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:16,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:16,994 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-01 19:54:17,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,083 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-01 19:54:17,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,137 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-01 19:54:17,138 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,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, 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-01 19:54:17,225 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-01 19:54:17,230 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-01 19:54:17,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:17,237 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-01 19:54:17,238 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,258 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,269 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,278 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:17,300 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-01 19:54:17,301 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-01-01 19:54:17,741 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-01 19:54:17,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:17,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-01 19:54:17,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:54:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:54:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:17,771 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 13 states. [2019-01-01 19:54:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:18,407 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-01 19:54:18,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 19:54:18,408 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-01-01 19:54:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:18,409 INFO L225 Difference]: With dead ends: 82 [2019-01-01 19:54:18,409 INFO L226 Difference]: Without dead ends: 82 [2019-01-01 19:54:18,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:54:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-01 19:54:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-01 19:54:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 19:54:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-01-01 19:54:18,420 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 32 [2019-01-01 19:54:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:18,420 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-01-01 19:54:18,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:54:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-01-01 19:54:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:54:18,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:18,423 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-01 19:54:18,424 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:18,424 INFO L82 PathProgramCache]: Analyzing trace with hash -428261789, now seen corresponding path program 1 times [2019-01-01 19:54:18,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:18,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:18,563 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-01 19:54:18,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:18,565 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-01 19:54:18,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:18,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:18,690 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-01 19:54:18,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:18,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 19:54:18,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:54:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:54:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:54:18,710 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 10 states. [2019-01-01 19:54:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:18,809 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-01-01 19:54:18,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:54:18,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-01 19:54:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:18,813 INFO L225 Difference]: With dead ends: 85 [2019-01-01 19:54:18,813 INFO L226 Difference]: Without dead ends: 85 [2019-01-01 19:54:18,816 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-01 19:54:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-01 19:54:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-01-01 19:54:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 19:54:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-01 19:54:18,828 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 36 [2019-01-01 19:54:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:18,828 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-01 19:54:18,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:54:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-01 19:54:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-01 19:54:18,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:18,833 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-01 19:54:18,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash 507961674, now seen corresponding path program 2 times [2019-01-01 19:54:18,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:18,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:18,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:18,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:19,767 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-01 19:54:19,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:19,767 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-01 19:54:19,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:19,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:19,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:19,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:19,810 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-01 19:54:19,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:19,833 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-01 19:54:19,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:19,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:19,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,009 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-01 19:54:20,159 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-01-01 19:54:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,228 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-01 19:54:20,264 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-01 19:54:20,265 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:20,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,404 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-01 19:54:20,406 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:20,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:54:20,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,602 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-01 19:54:20,607 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-01 19:54:20,608 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:20,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:20,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:54:20,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,870 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-01 19:54:20,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:20,920 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-01 19:54:20,931 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-01 19:54:20,932 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:20,950 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:20,970 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:21,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 19:54:21,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 19:54:21,316 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-01 19:54:21,317 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:50, output treesize:214 [2019-01-01 19:54:21,536 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-01 19:54:21,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:21,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2019-01-01 19:54:21,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:54:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:54:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:21,571 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 11 states. [2019-01-01 19:54:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:22,056 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-01-01 19:54:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:54:22,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-01 19:54:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:22,059 INFO L225 Difference]: With dead ends: 87 [2019-01-01 19:54:22,059 INFO L226 Difference]: Without dead ends: 87 [2019-01-01 19:54:22,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-01 19:54:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-01 19:54:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-01-01 19:54:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 19:54:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-01-01 19:54:22,067 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2019-01-01 19:54:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:22,067 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-01-01 19:54:22,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:54:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-01-01 19:54:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 19:54:22,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:22,071 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-01 19:54:22,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 23527684, now seen corresponding path program 1 times [2019-01-01 19:54:22,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:22,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:22,298 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-01 19:54:22,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:22,298 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-01 19:54:22,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:22,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:22,369 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-01 19:54:22,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:22,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-01 19:54:22,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:54:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:54:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:22,391 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 12 states. [2019-01-01 19:54:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:22,485 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-01-01 19:54:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:54:22,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-01-01 19:54:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:22,487 INFO L225 Difference]: With dead ends: 90 [2019-01-01 19:54:22,487 INFO L226 Difference]: Without dead ends: 90 [2019-01-01 19:54:22,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-01 19:54:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-01-01 19:54:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-01 19:54:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-01-01 19:54:22,504 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 42 [2019-01-01 19:54:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:22,504 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-01-01 19:54:22,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:54:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-01-01 19:54:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:54:22,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:22,506 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-01 19:54:22,506 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -659383637, now seen corresponding path program 2 times [2019-01-01 19:54:22,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:22,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:22,692 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-01 19:54:22,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:22,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 19:54:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:22,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:22,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:22,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:22,752 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-01 19:54:22,759 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-01 19:54:22,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,768 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-01 19:54:22,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,785 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-01 19:54:22,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:22,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:22,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:22,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:22,851 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-01 19:54:22,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,865 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-01 19:54:22,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:22,973 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-01 19:54:23,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,088 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-01 19:54:23,089 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:23,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,134 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-01 19:54:23,134 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:23,153 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:23,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,190 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-01 19:54:23,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:23,244 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-01 19:54:23,245 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:23,291 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:23,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:23,306 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:23,319 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-01 19:54:23,319 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:50, output treesize:32 [2019-01-01 19:54:23,710 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 19:54:24,094 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 19:54:24,113 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-01 19:54:24,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:24,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2019-01-01 19:54:24,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 19:54:24,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 19:54:24,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-01 19:54:24,134 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 15 states. [2019-01-01 19:54:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:24,714 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-01-01 19:54:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:54:24,715 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-01-01 19:54:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:24,717 INFO L225 Difference]: With dead ends: 90 [2019-01-01 19:54:24,718 INFO L226 Difference]: Without dead ends: 90 [2019-01-01 19:54:24,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-01-01 19:54:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-01 19:54:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-01 19:54:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 19:54:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-01-01 19:54:24,724 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 45 [2019-01-01 19:54:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:24,724 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-01-01 19:54:24,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 19:54:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-01-01 19:54:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 19:54:24,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:24,728 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-01 19:54:24,728 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -590033308, now seen corresponding path program 1 times [2019-01-01 19:54:24,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:24,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:24,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:24,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:24,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:24,899 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-01 19:54:24,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:24,900 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-01 19:54:24,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:24,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:24,971 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-01 19:54:24,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:24,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 19:54:24,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:54:24,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:54:24,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:24,995 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states. [2019-01-01 19:54:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:25,014 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-01-01 19:54:25,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:54:25,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-01 19:54:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:25,017 INFO L225 Difference]: With dead ends: 99 [2019-01-01 19:54:25,017 INFO L226 Difference]: Without dead ends: 99 [2019-01-01 19:54:25,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-01 19:54:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-01-01 19:54:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-01 19:54:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-01 19:54:25,021 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 57 [2019-01-01 19:54:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:25,023 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-01 19:54:25,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:54:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-01 19:54:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 19:54:25,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:25,024 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-01 19:54:25,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:25,026 INFO L82 PathProgramCache]: Analyzing trace with hash -317183978, now seen corresponding path program 2 times [2019-01-01 19:54:25,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:25,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:25,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:25,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:25,111 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-01 19:54:25,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:25,112 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-01 19:54:25,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:25,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:25,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:25,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:25,160 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-01 19:54:25,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:25,179 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-01 19:54:25,192 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-01 19:54:25,202 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-01 19:54:25,217 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-01 19:54:25,218 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:25,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:25,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:25,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:25,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:25,270 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-01 19:54:25,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:25,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:25,290 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-01 19:54:25,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:25,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:25,341 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-01 19:54:25,342 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:25,403 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-01 19:54:25,405 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:25,456 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:54:25,518 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-01 19:54:25,527 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-01 19:54:25,528 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:25,540 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:25,593 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:54:25,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 19:54:25,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 19:54:25,761 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-01 19:54:25,762 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:18, output treesize:114 [2019-01-01 19:54:26,182 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 19:54:26,432 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 19:54:26,440 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-01 19:54:26,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:26,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:26,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:26,466 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-01 19:54:26,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:26,493 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-01 19:54:26,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:48 [2019-01-01 19:54:26,540 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-01 19:54:26,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:26,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-01 19:54:26,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:54:26,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:54:26,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:26,560 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 9 states. [2019-01-01 19:54:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:26,910 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-01-01 19:54:26,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:54:26,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-01-01 19:54:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:26,913 INFO L225 Difference]: With dead ends: 103 [2019-01-01 19:54:26,913 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:54:26,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-01-01 19:54:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:54:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-01 19:54:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 19:54:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-01-01 19:54:26,920 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 62 [2019-01-01 19:54:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:26,920 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-01-01 19:54:26,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:54:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-01-01 19:54:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 19:54:26,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:26,924 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-01 19:54:26,924 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1648161371, now seen corresponding path program 1 times [2019-01-01 19:54:26,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:26,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:26,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:27,032 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-01 19:54:27,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:27,032 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-01 19:54:27,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:27,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:27,115 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-01 19:54:27,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:27,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 19:54:27,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:54:27,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:54:27,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:54:27,135 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 7 states. [2019-01-01 19:54:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:27,166 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-01-01 19:54:27,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:27,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-01 19:54:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:27,169 INFO L225 Difference]: With dead ends: 108 [2019-01-01 19:54:27,169 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 19:54:27,169 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-01 19:54:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 19:54:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-01-01 19:54:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:54:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-01-01 19:54:27,173 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 67 [2019-01-01 19:54:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:27,174 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-01-01 19:54:27,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:54:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-01-01 19:54:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-01 19:54:27,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:27,178 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-01 19:54:27,178 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:27,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2138009815, now seen corresponding path program 2 times [2019-01-01 19:54:27,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:27,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:27,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:27,345 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-01 19:54:27,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:27,346 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-01 19:54:27,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:27,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:27,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:27,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:27,398 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-01 19:54:27,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,418 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-01 19:54:27,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,468 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-01 19:54:27,585 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-01-01 19:54:27,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,596 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-01 19:54:27,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,639 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-01 19:54:27,640 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,714 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-01 19:54:27,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,745 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-01 19:54:27,746 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,754 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,813 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-01 19:54:27,817 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-01 19:54:27,821 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-01 19:54:27,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:27,885 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-01 19:54:27,886 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,903 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,910 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,917 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:27,940 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-01 19:54:27,940 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:50, output treesize:32 [2019-01-01 19:54:28,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:28,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:28,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:28,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:28,131 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-01 19:54:28,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:28,192 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-01 19:54:28,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:88 [2019-01-01 19:54:28,385 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-01 19:54:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-01 19:54:28,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:54:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:54:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:28,404 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 12 states. [2019-01-01 19:54:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:28,942 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-01 19:54:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:54:28,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-01-01 19:54:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:28,946 INFO L225 Difference]: With dead ends: 113 [2019-01-01 19:54:28,946 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 19:54:28,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:54:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 19:54:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-01-01 19:54:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 19:54:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-01-01 19:54:28,954 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 72 [2019-01-01 19:54:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:28,954 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-01-01 19:54:28,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:54:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-01-01 19:54:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-01 19:54:28,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:28,955 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-01 19:54:28,955 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1123262533, now seen corresponding path program 1 times [2019-01-01 19:54:28,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:28,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:28,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:29,021 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-01 19:54:29,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:29,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:54:29,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:54:29,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:54:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:54:29,024 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 3 states. [2019-01-01 19:54:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:29,061 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-01-01 19:54:29,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:54:29,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-01-01 19:54:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:29,063 INFO L225 Difference]: With dead ends: 108 [2019-01-01 19:54:29,063 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 19:54:29,063 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-01 19:54:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 19:54:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-01 19:54:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:54:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-01-01 19:54:29,067 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 78 [2019-01-01 19:54:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:29,067 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-01-01 19:54:29,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:54:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-01-01 19:54:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-01 19:54:29,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:29,068 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-01 19:54:29,069 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1123262532, now seen corresponding path program 1 times [2019-01-01 19:54:29,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:29,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:29,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:29,737 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-01 19:54:29,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:29,737 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-01 19:54:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:29,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:29,822 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-01 19:54:29,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:29,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-01 19:54:29,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:54:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:54:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:29,851 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 9 states. [2019-01-01 19:54:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:29,904 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-01 19:54:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:54:29,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-01-01 19:54:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:29,907 INFO L225 Difference]: With dead ends: 117 [2019-01-01 19:54:29,907 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 19:54:29,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 19:54:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-01-01 19:54:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 19:54:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-01-01 19:54:29,911 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 78 [2019-01-01 19:54:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:29,912 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-01-01 19:54:29,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:54:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-01-01 19:54:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-01 19:54:29,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:29,913 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-01 19:54:29,913 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:29,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1954125494, now seen corresponding path program 2 times [2019-01-01 19:54:29,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:29,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:29,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:29,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:29,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:30,341 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-01 19:54:30,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:30,342 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-01 19:54:30,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:30,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:30,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:30,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:30,393 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-01 19:54:30,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:30,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:30,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-01 19:54:30,439 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-01 19:54:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:30,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-01-01 19:54:30,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:54:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:54:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:30,460 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 11 states. [2019-01-01 19:54:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:30,589 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2019-01-01 19:54:30,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:54:30,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-01-01 19:54:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:30,591 INFO L225 Difference]: With dead ends: 121 [2019-01-01 19:54:30,592 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 19:54:30,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 19:54:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-01 19:54:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 19:54:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-01-01 19:54:30,598 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 83 [2019-01-01 19:54:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:30,598 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-01-01 19:54:30,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:54:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-01-01 19:54:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-01 19:54:30,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:30,599 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-01 19:54:30,600 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 283421384, now seen corresponding path program 1 times [2019-01-01 19:54:30,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:30,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:30,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:30,801 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-01 19:54:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:30,801 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-01 19:54:30,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:30,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:30,892 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-01 19:54:30,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-01 19:54:30,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:54:30,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:54:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:30,912 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 11 states. [2019-01-01 19:54:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:30,969 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-01-01 19:54:30,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:54:30,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-01-01 19:54:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:30,972 INFO L225 Difference]: With dead ends: 126 [2019-01-01 19:54:30,973 INFO L226 Difference]: Without dead ends: 126 [2019-01-01 19:54:30,973 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-01 19:54:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-01 19:54:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-01-01 19:54:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 19:54:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2019-01-01 19:54:30,977 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 97 [2019-01-01 19:54:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:30,977 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2019-01-01 19:54:30,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:54:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2019-01-01 19:54:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 19:54:30,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:30,978 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-01 19:54:30,979 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -663164294, now seen corresponding path program 2 times [2019-01-01 19:54:30,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:30,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:30,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:31,162 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-01 19:54:31,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:31,162 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-01 19:54:31,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:31,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:54:31,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:31,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:31,269 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-01 19:54:31,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:31,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-01 19:54:31,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:54:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:54:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:31,289 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 12 states. [2019-01-01 19:54:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:31,403 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-01 19:54:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:54:31,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2019-01-01 19:54:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:31,406 INFO L225 Difference]: With dead ends: 131 [2019-01-01 19:54:31,406 INFO L226 Difference]: Without dead ends: 131 [2019-01-01 19:54:31,407 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-01 19:54:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-01 19:54:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-01-01 19:54:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-01 19:54:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-01-01 19:54:31,413 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 102 [2019-01-01 19:54:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:31,414 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-01-01 19:54:31,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:54:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-01-01 19:54:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-01 19:54:31,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:31,418 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-01 19:54:31,419 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1584572936, now seen corresponding path program 3 times [2019-01-01 19:54:31,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:31,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:31,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:31,688 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-01 19:54:31,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:31,688 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-01 19:54:31,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:54:31,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-01 19:54:31,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:31,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:31,791 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-01 19:54:31,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:31,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-01-01 19:54:31,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 19:54:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 19:54:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-01 19:54:31,812 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 14 states. [2019-01-01 19:54:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:31,925 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2019-01-01 19:54:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:54:31,928 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-01-01 19:54:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:31,929 INFO L225 Difference]: With dead ends: 141 [2019-01-01 19:54:31,929 INFO L226 Difference]: Without dead ends: 141 [2019-01-01 19:54:31,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-01 19:54:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-01 19:54:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-01-01 19:54:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-01 19:54:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-01-01 19:54:31,933 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 107 [2019-01-01 19:54:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:31,934 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-01-01 19:54:31,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 19:54:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-01-01 19:54:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-01 19:54:31,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:31,935 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-01 19:54:31,935 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1387314960, now seen corresponding path program 4 times [2019-01-01 19:54:31,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:31,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:31,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:32,181 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-01 19:54:32,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:32,182 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-01 19:54:32,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 19:54:32,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 19:54:32,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:32,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:32,445 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-01 19:54:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:32,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 19:54:32,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:54:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:54:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:32,467 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 6 states. [2019-01-01 19:54:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:32,510 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2019-01-01 19:54:32,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:54:32,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-01-01 19:54:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:32,513 INFO L225 Difference]: With dead ends: 146 [2019-01-01 19:54:32,513 INFO L226 Difference]: Without dead ends: 146 [2019-01-01 19:54:32,513 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-01 19:54:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-01 19:54:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2019-01-01 19:54:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-01 19:54:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2019-01-01 19:54:32,522 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 117 [2019-01-01 19:54:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:32,523 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2019-01-01 19:54:32,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:54:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2019-01-01 19:54:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-01 19:54:32,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:32,527 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-01 19:54:32,527 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash -575903494, now seen corresponding path program 5 times [2019-01-01 19:54:32,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:32,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:32,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:32,677 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-01 19:54:32,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:32,677 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-01 19:54:32,688 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 19:54:35,983 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-01 19:54:35,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:35,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:36,056 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-01 19:54:36,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:36,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 19:54:36,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:54:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:54:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:54:36,102 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand 7 states. [2019-01-01 19:54:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:36,168 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2019-01-01 19:54:36,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:36,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2019-01-01 19:54:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:36,171 INFO L225 Difference]: With dead ends: 151 [2019-01-01 19:54:36,171 INFO L226 Difference]: Without dead ends: 151 [2019-01-01 19:54:36,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:54:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-01 19:54:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-01-01 19:54:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-01 19:54:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-01-01 19:54:36,175 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 122 [2019-01-01 19:54:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:36,176 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-01-01 19:54:36,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:54:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-01-01 19:54:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-01 19:54:36,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:36,179 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-01 19:54:36,179 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash -371170992, now seen corresponding path program 6 times [2019-01-01 19:54:36,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:36,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:36,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:36,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:36,501 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-01 19:54:36,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:36,501 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-01 19:54:36,511 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 19:54:37,483 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-01 19:54:37,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:37,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:37,520 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-01 19:54:37,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:37,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 19:54:37,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:54:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:54:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:37,542 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 8 states. [2019-01-01 19:54:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:37,583 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2019-01-01 19:54:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:54:37,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2019-01-01 19:54:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:37,587 INFO L225 Difference]: With dead ends: 156 [2019-01-01 19:54:37,587 INFO L226 Difference]: Without dead ends: 156 [2019-01-01 19:54:37,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-01 19:54:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-01-01 19:54:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-01 19:54:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-01-01 19:54:37,592 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 127 [2019-01-01 19:54:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:37,592 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-01-01 19:54:37,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:54:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-01-01 19:54:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-01 19:54:37,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:37,593 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-01 19:54:37,593 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1244147386, now seen corresponding path program 7 times [2019-01-01 19:54:37,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:37,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:37,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:37,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:37,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:37,727 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-01 19:54:37,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:37,727 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-01 19:54:37,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:37,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:37,837 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-01 19:54:37,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:37,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-01 19:54:37,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:54:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:54:37,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:37,857 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 9 states. [2019-01-01 19:54:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:37,945 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-01 19:54:37,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:54:37,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-01-01 19:54:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:37,947 INFO L225 Difference]: With dead ends: 161 [2019-01-01 19:54:37,948 INFO L226 Difference]: Without dead ends: 161 [2019-01-01 19:54:37,948 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-01 19:54:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-01 19:54:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2019-01-01 19:54:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-01 19:54:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-01-01 19:54:37,952 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 132 [2019-01-01 19:54:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:37,952 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-01-01 19:54:37,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:54:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-01-01 19:54:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-01 19:54:37,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:37,955 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-01 19:54:37,955 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2070269040, now seen corresponding path program 8 times [2019-01-01 19:54:37,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:37,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:37,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:38,097 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-01 19:54:38,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:38,097 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-01 19:54:38,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:38,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:54:38,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:38,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:38,208 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-01 19:54:38,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:38,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 19:54:38,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:54:38,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:54:38,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:54:38,228 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 10 states. [2019-01-01 19:54:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:38,287 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-01-01 19:54:38,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:54:38,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2019-01-01 19:54:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:38,290 INFO L225 Difference]: With dead ends: 166 [2019-01-01 19:54:38,290 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 19:54:38,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:54:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 19:54:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-01-01 19:54:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-01 19:54:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2019-01-01 19:54:38,295 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 137 [2019-01-01 19:54:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:38,295 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2019-01-01 19:54:38,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:54:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2019-01-01 19:54:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-01 19:54:38,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:38,296 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-01 19:54:38,297 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1106756730, now seen corresponding path program 9 times [2019-01-01 19:54:38,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:38,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:38,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:38,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:38,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:39,271 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-01 19:54:39,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:39,272 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-01 19:54:39,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:54:40,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-01 19:54:40,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:40,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:40,642 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-01 19:54:40,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:40,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-01 19:54:40,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:54:40,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:54:40,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:40,683 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand 11 states. [2019-01-01 19:54:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:41,148 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2019-01-01 19:54:41,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:54:41,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2019-01-01 19:54:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:41,151 INFO L225 Difference]: With dead ends: 171 [2019-01-01 19:54:41,151 INFO L226 Difference]: Without dead ends: 171 [2019-01-01 19:54:41,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-01 19:54:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-01-01 19:54:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-01 19:54:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-01-01 19:54:41,156 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 142 [2019-01-01 19:54:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:41,156 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-01-01 19:54:41,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:54:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-01-01 19:54:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-01 19:54:41,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:41,158 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-01 19:54:41,158 INFO L423 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:41,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:41,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1612565040, now seen corresponding path program 10 times [2019-01-01 19:54:41,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:41,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:41,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:41,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:41,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:41,775 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-01 19:54:41,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:41,775 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-01 19:54:41,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 19:54:42,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 19:54:42,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:42,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:42,887 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-01 19:54:42,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:42,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-01 19:54:42,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:54:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:54:42,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:42,918 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 12 states. [2019-01-01 19:54:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:43,537 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2019-01-01 19:54:43,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:54:43,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2019-01-01 19:54:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:43,539 INFO L225 Difference]: With dead ends: 176 [2019-01-01 19:54:43,539 INFO L226 Difference]: Without dead ends: 176 [2019-01-01 19:54:43,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-01 19:54:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2019-01-01 19:54:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-01 19:54:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2019-01-01 19:54:43,544 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 147 [2019-01-01 19:54:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:43,544 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2019-01-01 19:54:43,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:54:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2019-01-01 19:54:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-01 19:54:43,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:43,545 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-01 19:54:43,546 INFO L423 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:43,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:43,546 INFO L82 PathProgramCache]: Analyzing trace with hash -896062918, now seen corresponding path program 11 times [2019-01-01 19:54:43,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:43,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:43,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:44,505 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-01 19:54:44,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:44,506 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-01 19:54:44,524 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 19:55:07,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-01 19:55:07,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:07,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:07,683 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-01 19:55:07,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:07,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-01 19:55:07,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:55:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:55:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:55:07,709 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand 13 states. [2019-01-01 19:55:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:07,790 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2019-01-01 19:55:07,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:55:07,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 152 [2019-01-01 19:55:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:07,793 INFO L225 Difference]: With dead ends: 177 [2019-01-01 19:55:07,793 INFO L226 Difference]: Without dead ends: 177 [2019-01-01 19:55:07,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:55:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-01 19:55:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-01 19:55:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-01 19:55:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-01-01 19:55:07,801 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 152 [2019-01-01 19:55:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:07,801 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-01-01 19:55:07,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:55:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-01-01 19:55:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-01 19:55:07,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:07,803 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-01 19:55:07,803 INFO L423 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:55:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:07,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1136420880, now seen corresponding path program 12 times [2019-01-01 19:55:07,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:07,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:07,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:07,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:07,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:55:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:55:08,327 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 19:55:08,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:55:08 BoogieIcfgContainer [2019-01-01 19:55:08,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:55:08,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:55:08,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:55:08,444 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:55:08,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:09" (3/4) ... [2019-01-01 19:55:08,450 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 19:55:08,540 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:55:08,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:55:08,542 INFO L168 Benchmark]: Toolchain (without parser) took 60767.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 408.4 MB). Free memory was 951.3 MB in the beginning and 992.2 MB in the end (delta: -40.8 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:08,542 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:55:08,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:08,545 INFO L168 Benchmark]: Boogie Preprocessor took 79.86 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:08,545 INFO L168 Benchmark]: RCFGBuilder took 848.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:08,545 INFO L168 Benchmark]: TraceAbstraction took 59390.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.0 MB). Peak memory consumption was 361.5 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:08,548 INFO L168 Benchmark]: Witness Printer took 97.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:08,552 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.86 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 848.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59390.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.0 MB). Peak memory consumption was 361.5 MB. Max. memory is 11.5 GB. * Witness Printer took 97.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. 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, 59.3s OverallTime, 30 OverallIterations, 10 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1628 SDtfs, 948 SDslu, 7081 SDs, 0 SdLazy, 1965 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2308 GetRequests, 2047 SyntacticMatches, 4 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 76 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 31.0s SatisfiabilityAnalysisTime, 18.3s 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...