./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_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/getNumbers2_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 e872a0dffbf376eb2d8b1e3516401a8dafe115a6 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:04,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:54:04,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:54:04,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:54:04,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:54:04,199 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:54:04,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:54:04,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:54:04,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:54:04,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:54:04,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:54:04,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:54:04,207 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:54:04,208 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:54:04,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:54:04,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:54:04,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:54:04,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:54:04,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:54:04,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:54:04,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:54:04,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:54:04,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:54:04,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:54:04,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:54:04,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:54:04,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:54:04,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:54:04,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:54:04,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:54:04,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:54:04,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:54:04,230 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:54:04,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:54:04,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:54:04,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:54:04,233 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:04,258 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:54:04,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:54:04,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:54:04,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:54:04,260 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:54:04,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:54:04,264 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:54:04,264 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:54:04,264 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:54:04,264 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:54:04,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:54:04,265 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:54:04,265 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:54:04,265 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:54:04,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:54:04,265 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:54:04,266 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:54:04,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:54:04,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:54:04,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:54:04,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:54:04,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:54:04,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:54:04,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:54:04,269 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:54:04,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:54:04,270 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 -> e872a0dffbf376eb2d8b1e3516401a8dafe115a6 [2019-01-01 19:54:04,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:54:04,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:54:04,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:54:04,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:54:04,343 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:54:04,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2019-01-01 19:54:04,410 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35040c72/46517e0beb994705ac04cdb7a9826924/FLAGc7d383790 [2019-01-01 19:54:04,874 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:54:04,874 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2019-01-01 19:54:04,883 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35040c72/46517e0beb994705ac04cdb7a9826924/FLAGc7d383790 [2019-01-01 19:54:05,246 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35040c72/46517e0beb994705ac04cdb7a9826924 [2019-01-01 19:54:05,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:54:05,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:54:05,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:54:05,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:54:05,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:54:05,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:54:05" (1/1) ... [2019-01-01 19:54:05,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3dafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:05, skipping insertion in model container [2019-01-01 19:54:05,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:54:05" (1/1) ... [2019-01-01 19:54:05,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:54:05,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:54:05,505 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:54:05,526 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:54:05,547 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:54:05,573 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:54:05,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:05 WrapperNode [2019-01-01 19:54:05,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:54:05,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:54:05,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:54:05,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:54:05,591 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:05" (1/1) ... [2019-01-01 19:54:05,592 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:05" (1/1) ... [2019-01-01 19:54:05,603 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:05" (1/1) ... [2019-01-01 19:54:05,604 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:05" (1/1) ... [2019-01-01 19:54:05,617 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:05" (1/1) ... [2019-01-01 19:54:05,623 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:05" (1/1) ... [2019-01-01 19:54:05,625 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:05" (1/1) ... [2019-01-01 19:54:05,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:54:05,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:54:05,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:54:05,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:54:05,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:05" (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:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:54:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:54:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-01 19:54:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-01 19:54:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:54:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-01 19:54:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:54:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-01 19:54:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 19:54:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:54:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:54:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:54:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:54:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:54:06,220 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:54:06,220 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 19:54:06,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:06 BoogieIcfgContainer [2019-01-01 19:54:06,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:54:06,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:54:06,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:54:06,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:54:06,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:54:05" (1/3) ... [2019-01-01 19:54:06,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39368738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:54:06, skipping insertion in model container [2019-01-01 19:54:06,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:05" (2/3) ... [2019-01-01 19:54:06,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39368738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:54:06, skipping insertion in model container [2019-01-01 19:54:06,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:06" (3/3) ... [2019-01-01 19:54:06,231 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2_false-valid-deref.c [2019-01-01 19:54:06,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:54:06,247 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-01 19:54:06,261 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-01 19:54:06,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:54:06,288 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:54:06,289 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:54:06,289 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:54:06,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:54:06,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:54:06,290 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:54:06,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:54:06,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:54:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-01-01 19:54:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 19:54:06,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:06,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:06,325 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash -262167437, now seen corresponding path program 1 times [2019-01-01 19:54:06,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:06,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:06,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:06,644 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:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:06,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 19:54:06,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:54:06,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:54:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:54:06,668 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2019-01-01 19:54:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:07,111 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-01 19:54:07,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:54:07,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 19:54:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:07,122 INFO L225 Difference]: With dead ends: 43 [2019-01-01 19:54:07,122 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 19:54:07,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:54:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 19:54:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-01 19:54:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 19:54:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-01 19:54:07,161 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2019-01-01 19:54:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:07,161 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-01 19:54:07,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:54:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-01 19:54:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 19:54:07,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:07,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:07,163 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:07,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:07,163 INFO L82 PathProgramCache]: Analyzing trace with hash -262167438, now seen corresponding path program 1 times [2019-01-01 19:54:07,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:07,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:07,256 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:07,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:07,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:54:07,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:54:07,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:54:07,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:54:07,260 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2019-01-01 19:54:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:07,315 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-01-01 19:54:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:54:07,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 19:54:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:07,318 INFO L225 Difference]: With dead ends: 37 [2019-01-01 19:54:07,318 INFO L226 Difference]: Without dead ends: 37 [2019-01-01 19:54:07,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-01 19:54:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-01 19:54:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 19:54:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-01 19:54:07,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2019-01-01 19:54:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:07,325 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-01 19:54:07,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:54:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-01 19:54:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 19:54:07,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:07,326 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:07,327 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1979581628, now seen corresponding path program 1 times [2019-01-01 19:54:07,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:07,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:07,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:07,685 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-01 19:54:07,687 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:07,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:07,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 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:07,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:07,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:07,807 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:07,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:07,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:07,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 19:54:07,859 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:07,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:07,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 19:54:07,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:54:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:54:07,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:07,882 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 5 states. [2019-01-01 19:54:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:08,120 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-01 19:54:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:54:08,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 19:54:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:08,122 INFO L225 Difference]: With dead ends: 41 [2019-01-01 19:54:08,122 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 19:54:08,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 19:54:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-01 19:54:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 19:54:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-01 19:54:08,130 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 13 [2019-01-01 19:54:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:08,130 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-01 19:54:08,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:54:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-01 19:54:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 19:54:08,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:08,131 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:08,132 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash 479651539, now seen corresponding path program 2 times [2019-01-01 19:54:08,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:08,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:08,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:08,889 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-01 19:54:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 19:54:08,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:08,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:54:08,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:54:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:54:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:08,895 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 6 states. [2019-01-01 19:54:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:09,034 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-01 19:54:09,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:09,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-01 19:54:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:09,037 INFO L225 Difference]: With dead ends: 39 [2019-01-01 19:54:09,037 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 19:54:09,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 19:54:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-01 19:54:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 19:54:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-01 19:54:09,044 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 16 [2019-01-01 19:54:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:09,044 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-01 19:54:09,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:54:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-01 19:54:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 19:54:09,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:09,046 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:09,046 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:09,046 INFO L82 PathProgramCache]: Analyzing trace with hash -680983352, now seen corresponding path program 1 times [2019-01-01 19:54:09,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:09,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:09,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:09,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 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:09,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:09,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:09,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:09,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 19:54:09,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:54:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:54:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:09,223 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 6 states. [2019-01-01 19:54:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:09,257 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-01 19:54:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:54:09,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-01 19:54:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:09,259 INFO L225 Difference]: With dead ends: 43 [2019-01-01 19:54:09,259 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 19:54:09,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 19:54:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-01-01 19:54:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 19:54:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-01 19:54:09,265 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 21 [2019-01-01 19:54:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:09,266 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-01 19:54:09,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:54:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-01 19:54:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 19:54:09,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:09,267 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:09,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash 974975319, now seen corresponding path program 2 times [2019-01-01 19:54:09,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:09,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:09,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:09,364 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:09,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:09,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:09,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:09,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:09,416 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 9 treesize of output 12 [2019-01-01 19:54:09,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:09,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:54:09,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:09,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:54:09,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:54:09,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2019-01-01 19:54:09,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:09,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:09,676 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 0 case distinctions, treesize of input 20 treesize of output 24 [2019-01-01 19:54:09,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:09,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:09,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:09,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:09,746 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2019-01-01 19:54:09,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:09,830 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:09,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:54 [2019-01-01 19:54:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 19:54:09,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:09,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-01-01 19:54:09,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:54:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:54:09,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:54:09,952 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2019-01-01 19:54:10,450 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-01-01 19:54:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:10,524 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-01 19:54:10,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:54:10,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-01 19:54:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:10,526 INFO L225 Difference]: With dead ends: 45 [2019-01-01 19:54:10,526 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 19:54:10,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:54:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 19:54:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-01-01 19:54:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 19:54:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-01 19:54:10,532 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 24 [2019-01-01 19:54:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:10,533 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-01 19:54:10,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:54:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-01 19:54:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 19:54:10,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:10,534 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:10,534 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1645381225, now seen corresponding path program 1 times [2019-01-01 19:54:10,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:10,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:10,791 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:10,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:10,792 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:10,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:10,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:10,909 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:10,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:10,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 19:54:10,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:54:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:54:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:10,931 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 8 states. [2019-01-01 19:54:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:10,983 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-01 19:54:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:54:10,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-01 19:54:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:10,985 INFO L225 Difference]: With dead ends: 48 [2019-01-01 19:54:10,985 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 19:54:10,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 19:54:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-01-01 19:54:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 19:54:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-01-01 19:54:10,990 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2019-01-01 19:54:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:10,990 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-01-01 19:54:10,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:54:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-01-01 19:54:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:54:10,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:10,991 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:10,992 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:10,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2109770680, now seen corresponding path program 2 times [2019-01-01 19:54:10,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:10,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:10,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:10,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:10,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:11,087 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:11,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:11,088 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:11,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:11,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:11,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:11,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:11,151 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:11,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:11,243 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 9 treesize of output 12 [2019-01-01 19:54:11,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,442 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:54:11,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:11,593 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:54:11,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:54:11,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:37 [2019-01-01 19:54:11,821 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:54:11,912 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, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2019-01-01 19:54:11,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:11,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:11,964 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2019-01-01 19:54:11,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-01 19:54:12,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:12,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-01 19:54:12,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:12,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:54:12,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:65, output treesize:50 [2019-01-01 19:54:12,204 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:12,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:12,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-01 19:54:12,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:54:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:54:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:12,225 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2019-01-01 19:54:12,489 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:54:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:13,099 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-01 19:54:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:54:13,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-01-01 19:54:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:13,102 INFO L225 Difference]: With dead ends: 51 [2019-01-01 19:54:13,102 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 19:54:13,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:54:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 19:54:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-01-01 19:54:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 19:54:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-01 19:54:13,109 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2019-01-01 19:54:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:13,110 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-01 19:54:13,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:54:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-01 19:54:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 19:54:13,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:13,111 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:13,111 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:13,112 INFO L82 PathProgramCache]: Analyzing trace with hash 432910569, now seen corresponding path program 1 times [2019-01-01 19:54:13,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:13,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:13,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-01 19:54:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:13,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:54:13,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:54:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:54:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:54:13,193 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 3 states. [2019-01-01 19:54:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:13,345 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-01 19:54:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:54:13,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-01 19:54:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:13,346 INFO L225 Difference]: With dead ends: 48 [2019-01-01 19:54:13,346 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 19:54:13,349 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:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 19:54:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-01 19:54:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 19:54:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-01 19:54:13,360 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 34 [2019-01-01 19:54:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:13,360 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-01 19:54:13,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:54:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-01 19:54:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 19:54:13,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:13,367 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:13,368 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash 432910570, now seen corresponding path program 1 times [2019-01-01 19:54:13,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:13,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:13,535 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:13,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:13,536 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:13,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:13,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:13,586 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:13,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:13,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 19:54:13,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:54:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:54:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:54:13,606 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 10 states. [2019-01-01 19:54:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:13,663 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-01-01 19:54:13,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:54:13,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-01-01 19:54:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:13,665 INFO L225 Difference]: With dead ends: 53 [2019-01-01 19:54:13,665 INFO L226 Difference]: Without dead ends: 53 [2019-01-01 19:54:13,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 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:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-01 19:54:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-01-01 19:54:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 19:54:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-01 19:54:13,671 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 34 [2019-01-01 19:54:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:13,671 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-01 19:54:13,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:54:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-01 19:54:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 19:54:13,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:13,673 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:13,676 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1833114437, now seen corresponding path program 2 times [2019-01-01 19:54:13,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:13,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:13,795 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:13,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:13,795 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:13,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:13,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:13,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:13,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:13,846 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:13,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:13,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-01 19:54:13,890 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:13,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:13,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-01-01 19:54:13,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:54:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:54:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:13,912 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 12 states. [2019-01-01 19:54:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:14,035 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-01 19:54:14,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:54:14,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-01-01 19:54:14,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:14,038 INFO L225 Difference]: With dead ends: 55 [2019-01-01 19:54:14,038 INFO L226 Difference]: Without dead ends: 55 [2019-01-01 19:54:14,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-01 19:54:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-01-01 19:54:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 19:54:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-01 19:54:14,043 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2019-01-01 19:54:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:14,043 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-01 19:54:14,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:54:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-01 19:54:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:54:14,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:14,045 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, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:14,045 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:14,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:14,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1195635521, now seen corresponding path program 1 times [2019-01-01 19:54:14,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:14,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:14,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:54:14,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:14,219 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:14,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:14,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:54:14,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:14,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-01 19:54:14,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:54:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:54:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:14,310 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2019-01-01 19:54:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:14,393 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-01-01 19:54:14,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:54:14,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-01-01 19:54:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:14,396 INFO L225 Difference]: With dead ends: 58 [2019-01-01 19:54:14,396 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 19:54:14,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 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:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 19:54:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-01 19:54:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 19:54:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-01 19:54:14,401 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 48 [2019-01-01 19:54:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:14,402 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-01 19:54:14,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:54:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-01 19:54:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 19:54:14,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:14,404 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:14,404 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 71279954, now seen corresponding path program 2 times [2019-01-01 19:54:14,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:14,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:54:15,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:15,596 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:15,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:15,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:54:15,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:15,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:54:15,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:15,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-01 19:54:15,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:54:15,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:54:15,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:15,711 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-01-01 19:54:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:15,848 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-01 19:54:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:54:15,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-01-01 19:54:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:15,850 INFO L225 Difference]: With dead ends: 59 [2019-01-01 19:54:15,850 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 19:54:15,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 19:54:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-01 19:54:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 19:54:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-01 19:54:15,857 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2019-01-01 19:54:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:15,858 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-01 19:54:15,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:54:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-01 19:54:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 19:54:15,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:15,861 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] [2019-01-01 19:54:15,861 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 844524961, now seen corresponding path program 3 times [2019-01-01 19:54:15,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:15,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:15,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:15,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:15,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:16,010 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:16,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:16,011 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:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:54:16,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-01 19:54:16,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:16,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:16,186 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:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 19:54:16,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:54:16,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:54:16,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:16,222 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2019-01-01 19:54:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:16,470 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-01-01 19:54:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:54:16,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-01-01 19:54:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:16,474 INFO L225 Difference]: With dead ends: 68 [2019-01-01 19:54:16,475 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 19:54:16,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 19:54:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-01-01 19:54:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 19:54:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-01 19:54:16,481 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 54 [2019-01-01 19:54:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:16,482 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-01 19:54:16,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:54:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-01 19:54:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 19:54:16,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:16,484 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] [2019-01-01 19:54:16,485 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1486456989, now seen corresponding path program 4 times [2019-01-01 19:54:16,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:16,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:16,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:16,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:16,729 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:16,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:16,729 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:16,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 19:54:16,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 19:54:16,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:16,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:16,921 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:16,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:16,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 19:54:16,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:54:16,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:54:16,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:16,955 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 6 states. [2019-01-01 19:54:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:17,025 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-01-01 19:54:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:54:17,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-01-01 19:54:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:17,028 INFO L225 Difference]: With dead ends: 73 [2019-01-01 19:54:17,028 INFO L226 Difference]: Without dead ends: 73 [2019-01-01 19:54:17,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-01 19:54:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-01-01 19:54:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 19:54:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-01 19:54:17,036 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 59 [2019-01-01 19:54:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:17,036 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-01 19:54:17,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:54:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-01 19:54:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 19:54:17,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:17,039 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] [2019-01-01 19:54:17,039 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1338250463, now seen corresponding path program 5 times [2019-01-01 19:54:17,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:17,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:17,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:17,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:17,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:17,165 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:17,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:17,166 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:17,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 19:54:17,270 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-01 19:54:17,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:17,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:17,291 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:17,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:17,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 19:54:17,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:54:17,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:54:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:54:17,311 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 7 states. [2019-01-01 19:54:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:17,354 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-01-01 19:54:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:17,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-01-01 19:54:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:17,355 INFO L225 Difference]: With dead ends: 78 [2019-01-01 19:54:17,355 INFO L226 Difference]: Without dead ends: 78 [2019-01-01 19:54:17,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 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:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-01 19:54:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-01-01 19:54:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-01 19:54:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-01-01 19:54:17,360 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 64 [2019-01-01 19:54:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:17,360 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-01-01 19:54:17,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:54:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-01-01 19:54:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-01 19:54:17,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:17,362 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] [2019-01-01 19:54:17,362 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:17,363 INFO L82 PathProgramCache]: Analyzing trace with hash -368674019, now seen corresponding path program 6 times [2019-01-01 19:54:17,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:17,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:17,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:17,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:17,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:17,483 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:17,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:17,483 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:17,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 19:54:17,678 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-01 19:54:17,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:17,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:17,735 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:17,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:17,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 19:54:17,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:54:17,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:54:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:17,756 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 8 states. [2019-01-01 19:54:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:17,836 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-01 19:54:17,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:54:17,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-01-01 19:54:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:17,838 INFO L225 Difference]: With dead ends: 83 [2019-01-01 19:54:17,838 INFO L226 Difference]: Without dead ends: 83 [2019-01-01 19:54:17,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-01 19:54:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-01-01 19:54:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 19:54:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-01 19:54:17,844 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-01-01 19:54:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:17,845 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-01 19:54:17,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:54:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-01 19:54:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-01 19:54:17,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:17,846 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] [2019-01-01 19:54:17,846 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:17,846 INFO L82 PathProgramCache]: Analyzing trace with hash -243103583, now seen corresponding path program 7 times [2019-01-01 19:54:17,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:17,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:17,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:17,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:17,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:18,294 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:18,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:18,295 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:18,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:18,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:18,365 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:18,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:18,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-01 19:54:18,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:54:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:54:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:18,385 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 9 states. [2019-01-01 19:54:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:18,442 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-01-01 19:54:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:54:18,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-01-01 19:54:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:18,447 INFO L225 Difference]: With dead ends: 88 [2019-01-01 19:54:18,447 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 19:54:18,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 19:54:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-01-01 19:54:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-01 19:54:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-01 19:54:18,458 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 74 [2019-01-01 19:54:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:18,458 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-01 19:54:18,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:54:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-01 19:54:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-01 19:54:18,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:18,465 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] [2019-01-01 19:54:18,465 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1204178333, now seen corresponding path program 8 times [2019-01-01 19:54:18,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:18,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:18,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:18,642 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:18,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:18,642 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:18,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:18,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:54:18,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:18,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:18,768 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:18,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 19:54:18,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:54:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:54:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:54:18,792 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 10 states. [2019-01-01 19:54:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:18,850 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-01-01 19:54:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:54:18,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-01-01 19:54:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:18,852 INFO L225 Difference]: With dead ends: 93 [2019-01-01 19:54:18,852 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 19:54:18,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 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,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 19:54:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-01-01 19:54:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 19:54:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-01 19:54:18,860 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2019-01-01 19:54:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:18,860 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-01 19:54:18,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:54:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-01 19:54:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-01 19:54:18,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:18,861 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] [2019-01-01 19:54:18,863 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2025699807, now seen corresponding path program 9 times [2019-01-01 19:54:18,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:18,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:18,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-01 19:54:19,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:19,137 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:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:54:19,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-01 19:54:19,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:19,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-01 19:54:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-01 19:54:19,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:54:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:54:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:19,470 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 11 states. [2019-01-01 19:54:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:19,598 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-01-01 19:54:19,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:54:19,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-01-01 19:54:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:19,600 INFO L225 Difference]: With dead ends: 98 [2019-01-01 19:54:19,600 INFO L226 Difference]: Without dead ends: 98 [2019-01-01 19:54:19,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:54:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-01 19:54:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-01-01 19:54:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-01 19:54:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-01-01 19:54:19,603 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2019-01-01 19:54:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:19,604 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-01-01 19:54:19,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:54:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-01-01 19:54:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 19:54:19,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:19,605 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] [2019-01-01 19:54:19,605 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash -809435107, now seen corresponding path program 10 times [2019-01-01 19:54:19,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:19,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:19,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-01 19:54:19,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:19,776 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:19,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 19:54:20,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 19:54:20,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:20,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-01 19:54:20,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:20,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-01 19:54:20,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:54:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:54:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:54:20,105 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2019-01-01 19:54:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:20,162 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-01 19:54:20,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:54:20,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-01-01 19:54:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:20,165 INFO L225 Difference]: With dead ends: 103 [2019-01-01 19:54:20,165 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:54:20,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 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:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:54:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-01 19:54:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 19:54:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-01 19:54:20,169 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 89 [2019-01-01 19:54:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:20,169 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-01 19:54:20,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:54:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-01 19:54:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 19:54:20,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:20,170 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] [2019-01-01 19:54:20,170 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:20,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:20,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2070731871, now seen corresponding path program 11 times [2019-01-01 19:54:20,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:20,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:20,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-01 19:54:20,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:20,404 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:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 19:54:22,860 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-01 19:54:22,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:22,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-01 19:54:22,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:22,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-01 19:54:22,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:54:22,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:54:22,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:22,986 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 13 states. [2019-01-01 19:54:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:23,079 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-01-01 19:54:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:54:23,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2019-01-01 19:54:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:23,082 INFO L225 Difference]: With dead ends: 104 [2019-01-01 19:54:23,082 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 19:54:23,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 19:54:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-01 19:54:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:54:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-01 19:54:23,087 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 94 [2019-01-01 19:54:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:23,087 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-01 19:54:23,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:54:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-01 19:54:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-01 19:54:23,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:23,090 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-01 19:54:23,090 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-01 19:54:23,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1646357859, now seen corresponding path program 12 times [2019-01-01 19:54:23,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:23,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:23,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:54:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 19:54:23,306 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 19:54:23,365 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-01 19:54:23,366 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-01 19:54:23,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:54:23 BoogieIcfgContainer [2019-01-01 19:54:23,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:54:23,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:54:23,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:54:23,420 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:54:23,420 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:06" (3/4) ... [2019-01-01 19:54:23,425 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 19:54:23,437 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-01 19:54:23,438 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-01 19:54:23,551 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:54:23,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:54:23,552 INFO L168 Benchmark]: Toolchain (without parser) took 18302.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 948.7 MB in the beginning and 918.3 MB in the end (delta: 30.4 MB). Peak memory consumption was 324.5 MB. Max. memory is 11.5 GB. [2019-01-01 19:54:23,554 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:54:23,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:54:23,555 INFO L168 Benchmark]: Boogie Preprocessor took 60.30 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:54:23,555 INFO L168 Benchmark]: RCFGBuilder took 584.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 19:54:23,557 INFO L168 Benchmark]: TraceAbstraction took 17196.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 927.3 MB in the end (delta: 151.1 MB). Peak memory consumption was 334.6 MB. Max. memory is 11.5 GB. [2019-01-01 19:54:23,558 INFO L168 Benchmark]: Witness Printer took 131.98 ms. Allocated memory is still 1.3 GB. Free memory was 927.3 MB in the beginning and 918.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-01-01 19:54:23,561 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.30 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 584.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17196.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 927.3 MB in the end (delta: 151.1 MB). Peak memory consumption was 334.6 MB. Max. memory is 11.5 GB. * Witness Printer took 131.98 ms. Allocated memory is still 1.3 GB. Free memory was 927.3 MB in the beginning and 918.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={1:0}] [L25] CALL, EXPR getNumbers2() VAL [array={1:0}] [L13] CALL, EXPR getNumbers() VAL [array={1:0}] [L5] int i = 0; VAL [array={1:0}, i=0] [L5] COND TRUE i < 10 VAL [array={1:0}, i=0] [L6] array[i] = i VAL [array={1:0}, i=0] [L5] ++i VAL [array={1:0}, i=1] [L5] COND TRUE i < 10 VAL [array={1:0}, i=1] [L6] array[i] = i VAL [array={1:0}, i=1] [L5] ++i VAL [array={1:0}, i=2] [L5] COND TRUE i < 10 VAL [array={1:0}, i=2] [L6] array[i] = i VAL [array={1:0}, i=2] [L5] ++i VAL [array={1:0}, i=3] [L5] COND TRUE i < 10 VAL [array={1:0}, i=3] [L6] array[i] = i VAL [array={1:0}, i=3] [L5] ++i VAL [array={1:0}, i=4] [L5] COND TRUE i < 10 VAL [array={1:0}, i=4] [L6] array[i] = i VAL [array={1:0}, i=4] [L5] ++i VAL [array={1:0}, i=5] [L5] COND TRUE i < 10 VAL [array={1:0}, i=5] [L6] array[i] = i VAL [array={1:0}, i=5] [L5] ++i VAL [array={1:0}, i=6] [L5] COND TRUE i < 10 VAL [array={1:0}, i=6] [L6] array[i] = i VAL [array={1:0}, i=6] [L5] ++i VAL [array={1:0}, i=7] [L5] COND TRUE i < 10 VAL [array={1:0}, i=7] [L6] array[i] = i VAL [array={1:0}, i=7] [L5] ++i VAL [array={1:0}, i=8] [L5] COND TRUE i < 10 VAL [array={1:0}, i=8] [L6] array[i] = i VAL [array={1:0}, i=8] [L5] ++i VAL [array={1:0}, i=9] [L5] COND TRUE i < 10 VAL [array={1:0}, i=9] [L6] array[i] = i VAL [array={1:0}, i=9] [L5] ++i VAL [array={1:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={1:0}, i=10] [L9] return array; VAL [\result={1:0}, array={1:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={1:0}, getNumbers()={1:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={1:0}, i=0, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={-1:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={-1:0}, numbers[i]=0] [L17] ++i VAL [array={1:0}, i=1, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={-1:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={-1:0}, numbers[i]=1] [L17] ++i VAL [array={1:0}, i=2, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={-1:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={-1:0}, numbers[i]=2] [L17] ++i VAL [array={1:0}, i=3, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={-1:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={-1:0}, numbers[i]=3] [L17] ++i VAL [array={1:0}, i=4, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={-1:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={-1:0}, numbers[i]=4] [L17] ++i VAL [array={1:0}, i=5, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={-1:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={-1:0}, numbers[i]=5] [L17] ++i VAL [array={1:0}, i=6, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={-1:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={-1:0}, numbers[i]=6] [L17] ++i VAL [array={1:0}, i=7, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={-1:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={-1:0}, numbers[i]=7] [L17] ++i VAL [array={1:0}, i=8, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={-1:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={-1:0}, numbers[i]=8] [L17] ++i VAL [array={1:0}, i=9, numbers={1:0}, numbers2={-1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={1:0}, numbers2={-1:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={-1:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={-1:0}, numbers[i]=9] [L17] ++i VAL [array={1:0}, i=10, numbers={1:0}, numbers2={-1:0}] [L17] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={1:0}, numbers2={-1:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={-1:0}, array={1:0}, i=10, numbers={1:0}] [L25] RET, EXPR getNumbers2() VAL [array={1:0}, getNumbers2()={-1:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 9 error locations. UNSAFE Result, 17.1s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 586 SDtfs, 494 SDslu, 2103 SDs, 0 SdLazy, 919 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1114 GetRequests, 948 SyntacticMatches, 9 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=22, 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, 22 MinimizatonAttempts, 50 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2071 NumberOfCodeBlocks, 1984 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1932 ConstructedInterpolants, 4 QuantifiedInterpolants, 260271 SizeOfPredicates, 27 NumberOfNonLiveVariables, 3225 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 2789/4774 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...