./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/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-0ed9222-m [2019-01-14 00:36:44,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:36:44,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:36:44,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:36:44,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:36:44,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:36:44,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:36:44,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:36:44,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:36:44,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:36:44,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:36:44,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:36:44,555 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:36:44,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:36:44,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:36:44,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:36:44,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:36:44,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:36:44,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:36:44,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:36:44,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:36:44,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:36:44,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:36:44,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:36:44,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:36:44,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:36:44,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:36:44,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:36:44,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:36:44,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:36:44,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:36:44,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:36:44,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:36:44,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:36:44,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:36:44,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:36:44,611 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:36:44,634 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:36:44,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:36:44,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:36:44,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:36:44,638 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:36:44,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:36:44,639 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:36:44,640 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:36:44,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:36:44,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:36:44,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:36:44,641 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:36:44,641 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:36:44,641 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:36:44,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:36:44,642 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:36:44,642 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:36:44,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:36:44,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:36:44,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:36:44,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:36:44,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:36:44,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:36:44,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:36:44,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:36:44,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:36:44,646 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-14 00:36:44,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:36:44,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:36:44,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:36:44,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:36:44,726 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:36:44,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2019-01-14 00:36:44,794 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9eccff50/e776d2521cda494da70553d58dc8cdff/FLAG782bbc989 [2019-01-14 00:36:45,206 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:36:45,207 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2019-01-14 00:36:45,213 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9eccff50/e776d2521cda494da70553d58dc8cdff/FLAG782bbc989 [2019-01-14 00:36:45,580 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9eccff50/e776d2521cda494da70553d58dc8cdff [2019-01-14 00:36:45,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:36:45,586 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:36:45,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:45,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:36:45,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:36:45,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fcbd4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45, skipping insertion in model container [2019-01-14 00:36:45,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:36:45,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:36:45,879 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:45,902 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:36:45,925 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:45,949 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:36:45,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45 WrapperNode [2019-01-14 00:36:45,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:45,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:36:45,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:36:45,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:36:45,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... [2019-01-14 00:36:45,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:36:45,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:36:45,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:36:45,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:36:45,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:36:46,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:36:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:36:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-14 00:36:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-14 00:36:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:36:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-14 00:36:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:36:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-14 00:36:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:36:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:36:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:36:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:36:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:36:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:36:46,558 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:36:46,559 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 00:36:46,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:46 BoogieIcfgContainer [2019-01-14 00:36:46,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:36:46,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:36:46,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:36:46,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:36:46,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:36:45" (1/3) ... [2019-01-14 00:36:46,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bad7286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:46, skipping insertion in model container [2019-01-14 00:36:46,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:45" (2/3) ... [2019-01-14 00:36:46,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bad7286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:46, skipping insertion in model container [2019-01-14 00:36:46,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:46" (3/3) ... [2019-01-14 00:36:46,568 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2_false-valid-deref.c [2019-01-14 00:36:46,578 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:36:46,585 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-14 00:36:46,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-14 00:36:46,624 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:36:46,624 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:36:46,625 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:36:46,625 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:36:46,625 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:36:46,625 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:36:46,626 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:36:46,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:36:46,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:36:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-01-14 00:36:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 00:36:46,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:46,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:46,656 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash -262167437, now seen corresponding path program 1 times [2019-01-14 00:36:46,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:46,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:46,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:46,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:46,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:47,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:47,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:36:47,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:36:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:36:47,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:36:47,019 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2019-01-14 00:36:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:47,322 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-14 00:36:47,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:36:47,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 00:36:47,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:47,334 INFO L225 Difference]: With dead ends: 43 [2019-01-14 00:36:47,335 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 00:36:47,337 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-14 00:36:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 00:36:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-14 00:36:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 00:36:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-14 00:36:47,380 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2019-01-14 00:36:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:47,380 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-14 00:36:47,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:36:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-14 00:36:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 00:36:47,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:47,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:47,381 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:47,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:47,382 INFO L82 PathProgramCache]: Analyzing trace with hash -262167438, now seen corresponding path program 1 times [2019-01-14 00:36:47,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:47,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:47,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:47,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:47,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:47,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:47,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:47,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:47,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:47,506 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2019-01-14 00:36:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:47,581 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-01-14 00:36:47,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:47,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 00:36:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:47,583 INFO L225 Difference]: With dead ends: 37 [2019-01-14 00:36:47,583 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 00:36:47,584 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-14 00:36:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 00:36:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-14 00:36:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 00:36:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-14 00:36:47,591 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2019-01-14 00:36:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:47,592 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-14 00:36:47,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-14 00:36:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:36:47,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:47,593 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:47,593 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1979581628, now seen corresponding path program 1 times [2019-01-14 00:36:47,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:47,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:47,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:47,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:47,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:47,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:47,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:47,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:47,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:36:47,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:47,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:47,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:36:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:48,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:48,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 00:36:48,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:36:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:36:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:36:48,164 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 5 states. [2019-01-14 00:36:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:48,361 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-14 00:36:48,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:36:48,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 00:36:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:48,364 INFO L225 Difference]: With dead ends: 41 [2019-01-14 00:36:48,364 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 00:36:48,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:36:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 00:36:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-14 00:36:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 00:36:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-14 00:36:48,371 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 13 [2019-01-14 00:36:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:48,372 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-14 00:36:48,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:36:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-14 00:36:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 00:36:48,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:48,373 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:48,373 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash 479651539, now seen corresponding path program 2 times [2019-01-14 00:36:48,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:48,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:48,798 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 00:36:49,059 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-14 00:36:49,062 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-14 00:36:49,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:49,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:36:49,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:49,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:49,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:49,064 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 6 states. [2019-01-14 00:36:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:49,170 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-14 00:36:49,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:36:49,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-14 00:36:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:49,173 INFO L225 Difference]: With dead ends: 39 [2019-01-14 00:36:49,174 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 00:36:49,174 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-14 00:36:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 00:36:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-14 00:36:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 00:36:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-14 00:36:49,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 16 [2019-01-14 00:36:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:49,181 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-14 00:36:49,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-14 00:36:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:36:49,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:49,182 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-14 00:36:49,183 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash -680983352, now seen corresponding path program 1 times [2019-01-14 00:36:49,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:49,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:49,270 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-14 00:36:49,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:49,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:49,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:49,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:49,349 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-14 00:36:49,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:49,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 00:36:49,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:49,374 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 6 states. [2019-01-14 00:36:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:49,414 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-14 00:36:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:36:49,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 00:36:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:49,416 INFO L225 Difference]: With dead ends: 43 [2019-01-14 00:36:49,417 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 00:36:49,417 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-14 00:36:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 00:36:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-01-14 00:36:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 00:36:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-14 00:36:49,424 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 21 [2019-01-14 00:36:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:49,424 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-14 00:36:49,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-14 00:36:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 00:36:49,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:49,426 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-14 00:36:49,426 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:49,426 INFO L82 PathProgramCache]: Analyzing trace with hash 974975319, now seen corresponding path program 2 times [2019-01-14 00:36:49,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:49,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:49,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:49,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:49,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:49,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:49,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:49,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:36:49,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:49,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:49,612 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-14 00:36:49,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:49,635 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-14 00:36:49,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:36:49,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:36:49,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:36:49,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2019-01-14 00:36:49,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:49,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:49,829 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-14 00:36:49,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:49,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:49,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:49,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:49,894 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-14 00:36:49,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:36:49,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:36:49,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:54 [2019-01-14 00:36:50,095 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-14 00:36:50,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:36:50,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-01-14 00:36:50,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:36:50,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:36:50,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:50,136 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2019-01-14 00:36:50,652 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-01-14 00:36:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:50,742 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-14 00:36:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:36:50,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-14 00:36:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:50,745 INFO L225 Difference]: With dead ends: 45 [2019-01-14 00:36:50,745 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 00:36:50,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:36:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 00:36:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-01-14 00:36:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 00:36:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-14 00:36:50,753 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 24 [2019-01-14 00:36:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:50,753 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-14 00:36:50,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:36:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-14 00:36:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 00:36:50,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:50,755 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-14 00:36:50,755 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1645381225, now seen corresponding path program 1 times [2019-01-14 00:36:50,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:50,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:50,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:50,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:50,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:51,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:51,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:51,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:51,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:36:51,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:36:51,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:36:51,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:51,113 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 8 states. [2019-01-14 00:36:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:51,170 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-14 00:36:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:36:51,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 00:36:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:51,177 INFO L225 Difference]: With dead ends: 48 [2019-01-14 00:36:51,177 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 00:36:51,178 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-14 00:36:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 00:36:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-01-14 00:36:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 00:36:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-01-14 00:36:51,184 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2019-01-14 00:36:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:51,184 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-01-14 00:36:51,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:36:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-01-14 00:36:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 00:36:51,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:51,187 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-14 00:36:51,188 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:51,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2109770680, now seen corresponding path program 2 times [2019-01-14 00:36:51,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:51,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:51,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:51,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:51,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:51,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:51,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:51,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:36:51,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:51,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:51,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:36:51,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:51,585 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-14 00:36:51,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:51,785 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-14 00:36:51,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:36:51,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:36:51,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:36:51,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:37 [2019-01-14 00:36:52,091 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 00:36:52,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,193 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-14 00:36:52,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,298 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-14 00:36:52,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,356 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-14 00:36:52,357 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:36:52,497 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-14 00:36:52,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:52,529 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-14 00:36:52,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:65, output treesize:50 [2019-01-14 00:36:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 00:36:52,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:36:52,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-14 00:36:52,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:36:52,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:36:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:36:52,819 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2019-01-14 00:36:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:53,688 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-14 00:36:53,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:36:53,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-01-14 00:36:53,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:53,691 INFO L225 Difference]: With dead ends: 51 [2019-01-14 00:36:53,691 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 00:36:53,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-14 00:36:53,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 00:36:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-01-14 00:36:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 00:36:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-14 00:36:53,697 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2019-01-14 00:36:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:53,697 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-14 00:36:53,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:36:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-14 00:36:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 00:36:53,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:53,698 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-14 00:36:53,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 432910569, now seen corresponding path program 1 times [2019-01-14 00:36:53,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:53,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:53,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-14 00:36:53,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:53,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:53,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:53,780 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 3 states. [2019-01-14 00:36:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:53,870 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-14 00:36:53,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:53,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-14 00:36:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:53,872 INFO L225 Difference]: With dead ends: 48 [2019-01-14 00:36:53,872 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 00:36:53,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 00:36:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-14 00:36:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 00:36:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-14 00:36:53,877 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 34 [2019-01-14 00:36:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:53,877 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-14 00:36:53,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-14 00:36:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 00:36:53,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:53,880 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-14 00:36:53,880 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:53,880 INFO L82 PathProgramCache]: Analyzing trace with hash 432910570, now seen corresponding path program 1 times [2019-01-14 00:36:53,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:53,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:53,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:53,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:53,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:54,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:54,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:54,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:54,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:54,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:54,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 00:36:54,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:36:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:36:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:54,085 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 10 states. [2019-01-14 00:36:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:54,143 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-01-14 00:36:54,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:36:54,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-01-14 00:36:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:54,145 INFO L225 Difference]: With dead ends: 53 [2019-01-14 00:36:54,146 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 00:36:54,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 00:36:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-01-14 00:36:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 00:36:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-14 00:36:54,150 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 34 [2019-01-14 00:36:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:54,151 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-14 00:36:54,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:36:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-14 00:36:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 00:36:54,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:54,152 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-14 00:36:54,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1833114437, now seen corresponding path program 2 times [2019-01-14 00:36:54,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:54,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:54,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:54,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:54,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:54,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:54,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:36:54,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:54,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:54,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:36:54,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:36:54,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:36:54,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 00:36:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-14 00:36:54,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:36:54,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-01-14 00:36:54,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:36:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:36:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:36:54,398 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 12 states. [2019-01-14 00:36:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:54,490 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-14 00:36:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:36:54,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-01-14 00:36:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:54,493 INFO L225 Difference]: With dead ends: 55 [2019-01-14 00:36:54,493 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 00:36:54,494 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-14 00:36:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 00:36:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-01-14 00:36:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 00:36:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-14 00:36:54,498 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2019-01-14 00:36:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:54,499 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-14 00:36:54,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:36:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-14 00:36:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:36:54,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:54,500 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-14 00:36:54,500 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1195635521, now seen corresponding path program 1 times [2019-01-14 00:36:54,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:54,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:54,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:54,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:54,616 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-14 00:36:54,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:54,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:54,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:54,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:54,688 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-14 00:36:54,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:54,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:36:54,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:36:54,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:36:54,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:36:54,709 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2019-01-14 00:36:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:54,807 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-01-14 00:36:54,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:36:54,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-01-14 00:36:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:54,810 INFO L225 Difference]: With dead ends: 58 [2019-01-14 00:36:54,810 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 00:36:54,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:36:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 00:36:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-14 00:36:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 00:36:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-14 00:36:54,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 48 [2019-01-14 00:36:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:54,818 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-14 00:36:54,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:36:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-14 00:36:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 00:36:54,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:54,820 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-14 00:36:54,820 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:54,821 INFO L82 PathProgramCache]: Analyzing trace with hash 71279954, now seen corresponding path program 2 times [2019-01-14 00:36:54,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:54,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:54,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:36:55,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:55,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:55,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:55,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:36:55,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:55,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:36:55,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:55,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 00:36:55,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:36:55,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:36:55,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:36:55,253 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-01-14 00:36:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:55,360 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-14 00:36:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:36:55,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-01-14 00:36:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:55,363 INFO L225 Difference]: With dead ends: 59 [2019-01-14 00:36:55,363 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 00:36:55,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 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-14 00:36:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 00:36:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-14 00:36:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 00:36:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-14 00:36:55,370 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2019-01-14 00:36:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:55,371 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-14 00:36:55,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:36:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-14 00:36:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 00:36:55,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:55,374 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-14 00:36:55,374 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash 844524961, now seen corresponding path program 3 times [2019-01-14 00:36:55,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:55,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:55,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:55,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:55,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:55,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:55,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:55,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:36:55,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 00:36:55,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:55,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:55,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:55,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 00:36:55,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:36:55,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:36:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:36:55,792 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2019-01-14 00:36:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:56,043 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-01-14 00:36:56,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:36:56,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-01-14 00:36:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:56,045 INFO L225 Difference]: With dead ends: 68 [2019-01-14 00:36:56,045 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 00:36:56,045 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-14 00:36:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 00:36:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-01-14 00:36:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 00:36:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-14 00:36:56,059 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 54 [2019-01-14 00:36:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:56,060 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-14 00:36:56,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:36:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-14 00:36:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 00:36:56,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:56,067 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-14 00:36:56,067 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:56,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1486456989, now seen corresponding path program 4 times [2019-01-14 00:36:56,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:56,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:56,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:56,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:56,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:56,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:56,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:56,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 00:36:56,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 00:36:56,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:56,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:56,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:56,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 00:36:56,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:56,535 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 6 states. [2019-01-14 00:36:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:56,585 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-01-14 00:36:56,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:36:56,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-01-14 00:36:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:56,587 INFO L225 Difference]: With dead ends: 73 [2019-01-14 00:36:56,587 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 00:36:56,588 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-14 00:36:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 00:36:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-01-14 00:36:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 00:36:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-14 00:36:56,594 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 59 [2019-01-14 00:36:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:56,594 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-14 00:36:56,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-14 00:36:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 00:36:56,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:56,598 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-14 00:36:56,598 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1338250463, now seen corresponding path program 5 times [2019-01-14 00:36:56,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:56,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:56,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:56,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:56,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:56,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:56,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:56,742 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 00:36:56,835 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 00:36:56,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:56,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:56,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:56,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 00:36:56,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:36:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:36:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:36:56,886 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 7 states. [2019-01-14 00:36:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:56,943 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-01-14 00:36:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:36:56,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-01-14 00:36:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:56,945 INFO L225 Difference]: With dead ends: 78 [2019-01-14 00:36:56,945 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 00:36:56,946 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-14 00:36:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 00:36:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-01-14 00:36:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 00:36:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-01-14 00:36:56,950 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 64 [2019-01-14 00:36:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:56,952 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-01-14 00:36:56,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:36:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-01-14 00:36:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 00:36:56,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:56,954 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-14 00:36:56,955 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash -368674019, now seen corresponding path program 6 times [2019-01-14 00:36:56,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:56,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:56,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:57,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:57,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:57,086 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 00:36:57,244 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 00:36:57,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:57,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:36:57,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:36:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:36:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:57,297 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 8 states. [2019-01-14 00:36:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:57,342 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-14 00:36:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:36:57,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-01-14 00:36:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:57,344 INFO L225 Difference]: With dead ends: 83 [2019-01-14 00:36:57,344 INFO L226 Difference]: Without dead ends: 83 [2019-01-14 00:36:57,345 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-14 00:36:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-14 00:36:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-01-14 00:36:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:36:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-14 00:36:57,349 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-01-14 00:36:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:57,349 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-14 00:36:57,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:36:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-14 00:36:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 00:36:57,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:57,351 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-14 00:36:57,351 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash -243103583, now seen corresponding path program 7 times [2019-01-14 00:36:57,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:57,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:57,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:57,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:57,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:57,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:57,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:57,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:57,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 00:36:57,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:36:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:36:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:36:57,607 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 9 states. [2019-01-14 00:36:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:57,688 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-01-14 00:36:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:36:57,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-01-14 00:36:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:57,690 INFO L225 Difference]: With dead ends: 88 [2019-01-14 00:36:57,690 INFO L226 Difference]: Without dead ends: 88 [2019-01-14 00:36:57,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:36:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-14 00:36:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-01-14 00:36:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 00:36:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-14 00:36:57,694 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 74 [2019-01-14 00:36:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:57,695 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-14 00:36:57,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:36:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-14 00:36:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 00:36:57,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:57,699 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-14 00:36:57,699 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1204178333, now seen corresponding path program 8 times [2019-01-14 00:36:57,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:57,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:57,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:57,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:57,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:57,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:36:57,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:57,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:36:57,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:57,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 00:36:57,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:36:57,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:36:57,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:57,967 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 10 states. [2019-01-14 00:36:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:58,052 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-01-14 00:36:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:36:58,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-01-14 00:36:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:58,055 INFO L225 Difference]: With dead ends: 93 [2019-01-14 00:36:58,055 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 00:36:58,056 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-14 00:36:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 00:36:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-01-14 00:36:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 00:36:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-14 00:36:58,059 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2019-01-14 00:36:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:58,059 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-14 00:36:58,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:36:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-14 00:36:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 00:36:58,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:58,063 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-14 00:36:58,064 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:58,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:58,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2025699807, now seen corresponding path program 9 times [2019-01-14 00:36:58,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:58,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:58,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:58,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:58,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:58,785 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-14 00:36:58,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:58,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:58,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:36:59,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-14 00:36:59,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:59,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:59,056 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-14 00:36:59,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:59,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 00:36:59,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:36:59,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:36:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:36:59,076 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 11 states. [2019-01-14 00:36:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:59,167 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-01-14 00:36:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:36:59,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-01-14 00:36:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:59,169 INFO L225 Difference]: With dead ends: 98 [2019-01-14 00:36:59,169 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 00:36:59,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:36:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 00:36:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-01-14 00:36:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 00:36:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-01-14 00:36:59,172 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2019-01-14 00:36:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:59,174 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-01-14 00:36:59,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:36:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-01-14 00:36:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-14 00:36:59,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:59,176 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-14 00:36:59,177 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash -809435107, now seen corresponding path program 10 times [2019-01-14 00:36:59,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:59,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:59,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:59,518 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-14 00:36:59,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:59,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:59,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 00:36:59,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 00:36:59,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:59,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:59,794 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-14 00:36:59,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:59,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:36:59,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:36:59,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:36:59,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:36:59,815 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2019-01-14 00:36:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:59,880 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-14 00:36:59,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:36:59,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-01-14 00:36:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:59,883 INFO L225 Difference]: With dead ends: 103 [2019-01-14 00:36:59,883 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 00:36:59,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:36:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 00:36:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-14 00:36:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 00:36:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-14 00:36:59,888 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 89 [2019-01-14 00:36:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:59,888 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-14 00:36:59,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:36:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-14 00:36:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 00:36:59,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:59,891 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-14 00:36:59,892 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2070731871, now seen corresponding path program 11 times [2019-01-14 00:36:59,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:59,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:59,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:00,045 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-14 00:37:00,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:00,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 00:37:02,306 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 00:37:02,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:02,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:02,337 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-14 00:37:02,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:02,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 00:37:02,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:37:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:37:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:02,360 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 13 states. [2019-01-14 00:37:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:02,452 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-01-14 00:37:02,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:37:02,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2019-01-14 00:37:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:02,457 INFO L225 Difference]: With dead ends: 104 [2019-01-14 00:37:02,457 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 00:37:02,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:02,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 00:37:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-14 00:37:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:37:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-14 00:37:02,461 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 94 [2019-01-14 00:37:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:02,462 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-14 00:37:02,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:37:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-14 00:37:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 00:37:02,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:02,463 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-14 00:37:02,463 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:02,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1646357859, now seen corresponding path program 12 times [2019-01-14 00:37:02,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:02,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:02,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:02,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:02,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:37:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:37:02,647 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 00:37:02,687 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-14 00:37:02,688 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-14 00:37:02,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:37:02 BoogieIcfgContainer [2019-01-14 00:37:02,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:37:02,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:37:02,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:37:02,737 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:37:02,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:46" (3/4) ... [2019-01-14 00:37:02,741 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 00:37:02,758 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-14 00:37:02,758 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# [2019-01-14 00:37:02,841 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:37:02,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:37:02,843 INFO L168 Benchmark]: Toolchain (without parser) took 17257.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 951.4 MB in the beginning and 898.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 346.1 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:02,844 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:37:02,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:02,844 INFO L168 Benchmark]: Boogie Preprocessor took 46.63 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:37:02,847 INFO L168 Benchmark]: RCFGBuilder took 562.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:02,847 INFO L168 Benchmark]: TraceAbstraction took 16174.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 171.5 MB). Peak memory consumption was 348.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:02,848 INFO L168 Benchmark]: Witness Printer took 105.39 ms. Allocated memory is still 1.3 GB. Free memory was 907.1 MB in the beginning and 898.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:02,854 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.63 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 562.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16174.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 171.5 MB). Peak memory consumption was 348.8 MB. Max. memory is 11.5 GB. * Witness Printer took 105.39 ms. Allocated memory is still 1.3 GB. Free memory was 907.1 MB in the beginning and 898.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 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, 16.1s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 3.6s 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1114 GetRequests, 948 SyntacticMatches, 9 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 5.8s 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, 3.7s SatisfiabilityAnalysisTime, 7.1s 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...