./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/memsafety-ext3/getNumbers2.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.25-f470102 [2019-11-28 20:19:06,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:19:06,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:19:06,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:19:06,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:19:06,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:19:06,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:19:06,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:19:06,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:19:06,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:19:06,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:19:06,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:19:06,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:19:06,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:19:06,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:19:06,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:19:06,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:19:06,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:19:06,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:19:06,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:19:06,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:19:06,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:19:06,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:19:06,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:19:06,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:19:06,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:19:06,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:19:06,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:19:06,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:19:06,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:19:06,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:19:06,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:19:06,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:19:06,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:19:06,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:19:06,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:19:06,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:19:06,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:19:06,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:19:06,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:19:06,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:19:06,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:19:06,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:19:06,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:19:06,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:19:06,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:19:06,690 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:19:06,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:19:06,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:19:06,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:19:06,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:19:06,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:19:06,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:19:06,693 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:19:06,693 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:19:06,693 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:19:06,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:19:06,694 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:19:06,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:19:06,694 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:19:06,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:19:06,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:19:06,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:19:06,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:19:06,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:06,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:19:06,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:19:06,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:19:06,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:19:06,696 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:19:06,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-11-28 20:19:06,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:19:07,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:19:07,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:19:07,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:19:07,018 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:19:07,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2019-11-28 20:19:07,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a4e51d1/d6b60e3d56c348c19a88d83918eec63b/FLAGb0c55ea47 [2019-11-28 20:19:07,518 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:19:07,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2019-11-28 20:19:07,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a4e51d1/d6b60e3d56c348c19a88d83918eec63b/FLAGb0c55ea47 [2019-11-28 20:19:07,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a4e51d1/d6b60e3d56c348c19a88d83918eec63b [2019-11-28 20:19:07,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:19:07,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:19:07,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:07,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:19:07,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:19:07,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120696db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07, skipping insertion in model container [2019-11-28 20:19:07,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:19:07,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:19:08,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:08,193 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:19:08,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:08,227 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:19:08,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08 WrapperNode [2019-11-28 20:19:08,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:08,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:19:08,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:19:08,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:19:08,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... [2019-11-28 20:19:08,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... [2019-11-28 20:19:08,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... [2019-11-28 20:19:08,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... [2019-11-28 20:19:08,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... [2019-11-28 20:19:08,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... [2019-11-28 20:19:08,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... [2019-11-28 20:19:08,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:19:08,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:19:08,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:19:08,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:19:08,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:08,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:19:08,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:19:08,389 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-11-28 20:19:08,389 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-11-28 20:19:08,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:19:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-11-28 20:19:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:19:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-11-28 20:19:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:19:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:19:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:19:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:19:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:19:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:19:08,706 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:19:08,706 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 20:19:08,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:08 BoogieIcfgContainer [2019-11-28 20:19:08,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:19:08,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:19:08,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:19:08,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:19:08,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:07" (1/3) ... [2019-11-28 20:19:08,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3ffe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:08, skipping insertion in model container [2019-11-28 20:19:08,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:08" (2/3) ... [2019-11-28 20:19:08,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3ffe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:08, skipping insertion in model container [2019-11-28 20:19:08,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:08" (3/3) ... [2019-11-28 20:19:08,717 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers2.c [2019-11-28 20:19:08,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:19:08,733 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-11-28 20:19:08,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-11-28 20:19:08,763 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:19:08,764 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:19:08,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:19:08,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:19:08,764 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:19:08,764 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:19:08,764 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:19:08,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:19:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-11-28 20:19:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:19:08,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:08,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:08,791 INFO L410 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash -262167437, now seen corresponding path program 1 times [2019-11-28 20:19:08,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:08,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707314910] [2019-11-28 20:19:08,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707314910] [2019-11-28 20:19:09,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:09,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:09,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475249856] [2019-11-28 20:19:09,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:09,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:19:09,195 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 5 states. [2019-11-28 20:19:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,452 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-11-28 20:19:09,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:19:09,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 20:19:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,465 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:19:09,465 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:19:09,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:19:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-11-28 20:19:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:19:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-11-28 20:19:09,510 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2019-11-28 20:19:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,511 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-11-28 20:19:09,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-11-28 20:19:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:19:09,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -262167438, now seen corresponding path program 1 times [2019-11-28 20:19:09,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328293755] [2019-11-28 20:19:09,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328293755] [2019-11-28 20:19:09,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:09,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:19:09,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168510915] [2019-11-28 20:19:09,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:09,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:09,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,588 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2019-11-28 20:19:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,704 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-28 20:19:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:09,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:19:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,707 INFO L225 Difference]: With dead ends: 37 [2019-11-28 20:19:09,707 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 20:19:09,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:19:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 20:19:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 20:19:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:19:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-11-28 20:19:09,715 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2019-11-28 20:19:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,716 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-11-28 20:19:09,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-11-28 20:19:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:19:09,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,718 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,718 INFO L410 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:09,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1979581628, now seen corresponding path program 1 times [2019-11-28 20:19:09,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130764004] [2019-11-28 20:19:09,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130764004] [2019-11-28 20:19:09,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:09,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:19:09,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798401861] [2019-11-28 20:19:09,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:09,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:09,931 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 7 states. [2019-11-28 20:19:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:10,124 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-28 20:19:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:10,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-28 20:19:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:10,126 INFO L225 Difference]: With dead ends: 37 [2019-11-28 20:19:10,126 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 20:19:10,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 20:19:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-11-28 20:19:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 20:19:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 20:19:10,132 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 13 [2019-11-28 20:19:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:10,132 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 20:19:10,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 20:19:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:19:10,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:10,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:10,134 INFO L410 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -157413641, now seen corresponding path program 1 times [2019-11-28 20:19:10,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:10,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631808913] [2019-11-28 20:19:10,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631808913] [2019-11-28 20:19:10,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734403875] [2019-11-28 20:19:10,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:19:10,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:10,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2019-11-28 20:19:10,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482108797] [2019-11-28 20:19:10,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:19:10,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:19:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:10,392 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2019-11-28 20:19:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:10,678 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-11-28 20:19:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:10,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-28 20:19:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:10,681 INFO L225 Difference]: With dead ends: 44 [2019-11-28 20:19:10,681 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 20:19:10,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 20:19:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-11-28 20:19:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:19:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-11-28 20:19:10,689 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2019-11-28 20:19:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:10,689 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-11-28 20:19:10,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:19:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-11-28 20:19:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:19:10,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:10,691 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:10,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,905 INFO L410 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash -680983352, now seen corresponding path program 2 times [2019-11-28 20:19:10,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:10,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696146371] [2019-11-28 20:19:10,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:19:11,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696146371] [2019-11-28 20:19:11,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:11,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:19:11,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030177076] [2019-11-28 20:19:11,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:19:11,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:19:11,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:11,041 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 8 states. [2019-11-28 20:19:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,216 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-28 20:19:11,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:19:11,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 20:19:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,217 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:19:11,217 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:19:11,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:19:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-11-28 20:19:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:19:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-11-28 20:19:11,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 21 [2019-11-28 20:19:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,227 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-11-28 20:19:11,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:19:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-11-28 20:19:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:19:11,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,229 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,229 INFO L410 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash -680983351, now seen corresponding path program 1 times [2019-11-28 20:19:11,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440382075] [2019-11-28 20:19:11,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440382075] [2019-11-28 20:19:11,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583917144] [2019-11-28 20:19:11,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:19:11,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:11,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-11-28 20:19:11,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862422378] [2019-11-28 20:19:11,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:19:11,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:19:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:11,500 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 10 states. [2019-11-28 20:19:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,796 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 20:19:11,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:11,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-28 20:19:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,798 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:19:11,798 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:19:11,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:19:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:19:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-28 20:19:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:19:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-28 20:19:11,804 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 21 [2019-11-28 20:19:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,804 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-28 20:19:11,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:19:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-28 20:19:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:19:11,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,806 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,010 INFO L82 PathProgramCache]: Analyzing trace with hash 974975320, now seen corresponding path program 2 times [2019-11-28 20:19:12,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728701943] [2019-11-28 20:19:12,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728701943] [2019-11-28 20:19:12,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704716078] [2019-11-28 20:19:12,124 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:19:12,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:12,200 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 20:19:12,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:12,274 INFO L377 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-11-28 20:19:12,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:12,291 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:12,292 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:12,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:19:12,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:12,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-28 20:19:12,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:12,407 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-28 20:19:12,408 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:12,409 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2019-11-28 20:19:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:19:12,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:12,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-11-28 20:19:12,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474456385] [2019-11-28 20:19:12,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:12,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:12,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:12,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:12,476 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 7 states. [2019-11-28 20:19:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:12,631 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-11-28 20:19:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:19:12,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-28 20:19:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:12,634 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:19:12,634 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:19:12,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:19:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:19:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 20:19:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:19:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-28 20:19:12,639 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 24 [2019-11-28 20:19:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:12,639 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-28 20:19:12,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-28 20:19:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:19:12,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:12,640 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,845 INFO L410 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 159463802, now seen corresponding path program 1 times [2019-11-28 20:19:12,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586262995] [2019-11-28 20:19:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:19:12,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586262995] [2019-11-28 20:19:12,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:12,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:19:12,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190673987] [2019-11-28 20:19:12,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:12,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:19:12,902 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 5 states. [2019-11-28 20:19:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:12,971 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 20:19:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:12,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 20:19:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:12,972 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:19:12,973 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:19:12,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:19:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:19:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 20:19:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:19:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-11-28 20:19:12,977 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 25 [2019-11-28 20:19:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:12,977 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-11-28 20:19:12,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-11-28 20:19:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:19:12,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:12,979 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,979 INFO L410 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash 159463803, now seen corresponding path program 1 times [2019-11-28 20:19:12,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874796248] [2019-11-28 20:19:12,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874796248] [2019-11-28 20:19:13,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579580282] [2019-11-28 20:19:13,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:19:13,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:13,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-28 20:19:13,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084122337] [2019-11-28 20:19:13,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:19:13,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:19:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:13,127 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2019-11-28 20:19:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:13,226 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-28 20:19:13,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:19:13,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 20:19:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:13,227 INFO L225 Difference]: With dead ends: 44 [2019-11-28 20:19:13,228 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 20:19:13,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 20:19:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-28 20:19:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 20:19:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-28 20:19:13,232 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 25 [2019-11-28 20:19:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:13,232 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 20:19:13,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:19:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-11-28 20:19:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:19:13,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:13,233 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:13,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash -532789622, now seen corresponding path program 2 times [2019-11-28 20:19:13,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:13,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821649738] [2019-11-28 20:19:13,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821649738] [2019-11-28 20:19:13,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109567212] [2019-11-28 20:19:13,531 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:19:13,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:13,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:13,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:13,585 INFO L377 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-11-28 20:19:13,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:13,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:13,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:13,602 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:19:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 20:19:13,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:13,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-28 20:19:13,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371950963] [2019-11-28 20:19:13,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:13,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:13,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:13,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:13,641 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2019-11-28 20:19:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:13,671 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-11-28 20:19:13,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:13,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 20:19:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:13,673 INFO L225 Difference]: With dead ends: 41 [2019-11-28 20:19:13,673 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 20:19:13,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 20:19:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 20:19:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:19:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 20:19:13,677 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 28 [2019-11-28 20:19:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:13,677 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 20:19:13,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 20:19:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 20:19:13,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:13,679 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:13,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,885 INFO L410 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1115740543, now seen corresponding path program 1 times [2019-11-28 20:19:13,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:13,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476492932] [2019-11-28 20:19:13,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 20:19:14,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476492932] [2019-11-28 20:19:14,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564333266] [2019-11-28 20:19:14,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:14,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:19:14,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:14,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-28 20:19:14,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143531997] [2019-11-28 20:19:14,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:19:14,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:19:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:14,131 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 12 states. [2019-11-28 20:19:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:14,264 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-11-28 20:19:14,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:19:14,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-28 20:19:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:14,266 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:19:14,266 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:19:14,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:19:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-28 20:19:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:19:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-11-28 20:19:14,271 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 36 [2019-11-28 20:19:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:14,271 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-11-28 20:19:14,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:19:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-11-28 20:19:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 20:19:14,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:14,273 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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-11-28 20:19:14,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 391670476, now seen corresponding path program 2 times [2019-11-28 20:19:14,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:14,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248014851] [2019-11-28 20:19:14,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:14,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248014851] [2019-11-28 20:19:14,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060028714] [2019-11-28 20:19:14,764 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:14,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:14,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:19:14,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 20:19:14,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:14,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 14 [2019-11-28 20:19:14,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957518739] [2019-11-28 20:19:14,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:19:14,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:19:14,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:14,833 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 14 states. [2019-11-28 20:19:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:14,962 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 20:19:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:19:14,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-11-28 20:19:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:14,964 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:19:14,964 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:19:14,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:19:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:19:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-28 20:19:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:19:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-11-28 20:19:14,970 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 44 [2019-11-28 20:19:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:14,970 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-11-28 20:19:14,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:19:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-11-28 20:19:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 20:19:14,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:14,972 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 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-11-28 20:19:15,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:15,177 INFO L410 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1881551523, now seen corresponding path program 3 times [2019-11-28 20:19:15,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:15,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729530017] [2019-11-28 20:19:15,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:15,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729530017] [2019-11-28 20:19:15,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291406484] [2019-11-28 20:19:15,358 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:15,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 20:19:15,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:15,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:19:15,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 20:19:15,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:15,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-11-28 20:19:15,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468070163] [2019-11-28 20:19:15,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 20:19:15,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:15,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 20:19:15,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:19:15,466 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 18 states. [2019-11-28 20:19:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:15,653 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-28 20:19:15,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:19:15,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-28 20:19:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:15,655 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:19:15,655 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 20:19:15,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:19:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 20:19:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-11-28 20:19:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:19:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-11-28 20:19:15,662 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 47 [2019-11-28 20:19:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:15,662 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-11-28 20:19:15,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 20:19:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-11-28 20:19:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 20:19:15,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:15,664 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 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-11-28 20:19:15,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:15,868 INFO L410 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash -420814862, now seen corresponding path program 4 times [2019-11-28 20:19:15,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:15,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591347635] [2019-11-28 20:19:15,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:16,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591347635] [2019-11-28 20:19:16,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688485089] [2019-11-28 20:19:16,088 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:16,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:19:16,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:16,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:19:16,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 20:19:16,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:16,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 17 [2019-11-28 20:19:16,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112595818] [2019-11-28 20:19:16,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:19:16,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:16,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:19:16,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:19:16,154 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 17 states. [2019-11-28 20:19:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:16,324 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-11-28 20:19:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:19:16,325 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-11-28 20:19:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:16,326 INFO L225 Difference]: With dead ends: 65 [2019-11-28 20:19:16,326 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 20:19:16,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:19:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 20:19:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-28 20:19:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 20:19:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-11-28 20:19:16,331 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 55 [2019-11-28 20:19:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:16,331 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-11-28 20:19:16,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:19:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-11-28 20:19:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 20:19:16,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:16,333 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 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-11-28 20:19:16,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:16,538 INFO L410 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 548858049, now seen corresponding path program 5 times [2019-11-28 20:19:16,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:16,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852413423] [2019-11-28 20:19:16,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:16,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852413423] [2019-11-28 20:19:16,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998169553] [2019-11-28 20:19:16,813 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:16,925 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 20:19:16,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:16,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:19:16,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-28 20:19:16,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:16,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 20 [2019-11-28 20:19:16,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238589454] [2019-11-28 20:19:16,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 20:19:16,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 20:19:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:19:16,974 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 20 states. [2019-11-28 20:19:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:17,183 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-11-28 20:19:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 20:19:17,184 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2019-11-28 20:19:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:17,185 INFO L225 Difference]: With dead ends: 77 [2019-11-28 20:19:17,185 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 20:19:17,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:19:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 20:19:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-11-28 20:19:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 20:19:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-28 20:19:17,190 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 58 [2019-11-28 20:19:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:17,190 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-28 20:19:17,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 20:19:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-28 20:19:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 20:19:17,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:17,191 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 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-11-28 20:19:17,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:17,392 INFO L410 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash 897764172, now seen corresponding path program 6 times [2019-11-28 20:19:17,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:17,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668150261] [2019-11-28 20:19:17,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:17,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668150261] [2019-11-28 20:19:17,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588577328] [2019-11-28 20:19:17,660 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:17,802 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-28 20:19:17,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:17,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:17,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-28 20:19:17,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:17,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 21 [2019-11-28 20:19:17,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045292789] [2019-11-28 20:19:17,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:19:17,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:17,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:19:17,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:19:17,839 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 21 states. [2019-11-28 20:19:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:18,065 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-11-28 20:19:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:19:18,066 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-11-28 20:19:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:18,067 INFO L225 Difference]: With dead ends: 83 [2019-11-28 20:19:18,067 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 20:19:18,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-11-28 20:19:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 20:19:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-11-28 20:19:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 20:19:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-11-28 20:19:18,074 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 66 [2019-11-28 20:19:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:18,074 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-11-28 20:19:18,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:19:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-11-28 20:19:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 20:19:18,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:18,076 INFO L410 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-11-28 20:19:18,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:18,280 INFO L410 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:18,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:18,281 INFO L82 PathProgramCache]: Analyzing trace with hash -243103583, now seen corresponding path program 7 times [2019-11-28 20:19:18,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:18,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828360462] [2019-11-28 20:19:18,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:18,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828360462] [2019-11-28 20:19:18,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160251277] [2019-11-28 20:19:18,457 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:18,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:19:18,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:18,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:18,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2019-11-28 20:19:18,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657707149] [2019-11-28 20:19:18,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:19:18,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:18,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:19:18,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:18,535 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 11 states. [2019-11-28 20:19:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:18,651 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-11-28 20:19:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:18,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-11-28 20:19:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:18,653 INFO L225 Difference]: With dead ends: 88 [2019-11-28 20:19:18,653 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 20:19:18,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 20:19:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-11-28 20:19:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 20:19:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-11-28 20:19:18,658 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 74 [2019-11-28 20:19:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:18,659 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-11-28 20:19:18,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:19:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-11-28 20:19:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-28 20:19:18,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:18,660 INFO L410 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-11-28 20:19:18,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:18,864 INFO L410 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:18,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1204178333, now seen corresponding path program 8 times [2019-11-28 20:19:18,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:18,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12882592] [2019-11-28 20:19:18,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:19,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12882592] [2019-11-28 20:19:19,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047038351] [2019-11-28 20:19:19,059 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:19,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:19,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:19,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:19:19,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:19,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:19,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 12 [2019-11-28 20:19:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594531453] [2019-11-28 20:19:19,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:19:19,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:19:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:19,164 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 12 states. [2019-11-28 20:19:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:19,299 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-11-28 20:19:19,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:19:19,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2019-11-28 20:19:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:19,301 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:19:19,301 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 20:19:19,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 20:19:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-11-28 20:19:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 20:19:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-11-28 20:19:19,306 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2019-11-28 20:19:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:19,306 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-11-28 20:19:19,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:19:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-11-28 20:19:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 20:19:19,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:19,308 INFO L410 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-11-28 20:19:19,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:19,512 INFO L410 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2025699807, now seen corresponding path program 9 times [2019-11-28 20:19:19,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:19,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253731939] [2019-11-28 20:19:19,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:19,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253731939] [2019-11-28 20:19:19,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034651123] [2019-11-28 20:19:19,699 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:19,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-28 20:19:19,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:19,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:19:19,992 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 28 proven. 112 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-28 20:19:20,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:20,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2019-11-28 20:19:20,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114913962] [2019-11-28 20:19:20,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 20:19:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:19:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:19:20,046 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 15 states. [2019-11-28 20:19:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:20,255 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-11-28 20:19:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:19:20,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2019-11-28 20:19:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:20,258 INFO L225 Difference]: With dead ends: 98 [2019-11-28 20:19:20,258 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 20:19:20,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:19:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 20:19:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-11-28 20:19:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 20:19:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-11-28 20:19:20,263 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2019-11-28 20:19:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:20,263 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-11-28 20:19:20,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 20:19:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-11-28 20:19:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 20:19:20,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:20,265 INFO L410 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-11-28 20:19:20,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:20,466 INFO L410 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash -809435107, now seen corresponding path program 10 times [2019-11-28 20:19:20,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:20,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201679962] [2019-11-28 20:19:20,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:20,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201679962] [2019-11-28 20:19:20,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796030599] [2019-11-28 20:19:20,647 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:20,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:19:20,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:20,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:19:20,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:20,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:20,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 14 [2019-11-28 20:19:20,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043157408] [2019-11-28 20:19:20,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:19:20,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:19:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:20,991 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 14 states. [2019-11-28 20:19:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:21,142 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-11-28 20:19:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:19:21,143 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-11-28 20:19:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:21,144 INFO L225 Difference]: With dead ends: 103 [2019-11-28 20:19:21,144 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 20:19:21,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 20:19:21,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-28 20:19:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 20:19:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-11-28 20:19:21,149 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 89 [2019-11-28 20:19:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:21,149 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-11-28 20:19:21,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:19:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-11-28 20:19:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 20:19:21,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:21,151 INFO L410 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-11-28 20:19:21,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:21,356 INFO L410 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2070731871, now seen corresponding path program 11 times [2019-11-28 20:19:21,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:21,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262990261] [2019-11-28 20:19:21,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:21,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262990261] [2019-11-28 20:19:21,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864272822] [2019-11-28 20:19:21,572 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:22,962 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-28 20:19:22,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:22,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:19:22,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 20:19:22,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:22,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 15 [2019-11-28 20:19:22,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461935021] [2019-11-28 20:19:22,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 20:19:22,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:19:22,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:19:22,983 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 15 states. [2019-11-28 20:19:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:23,147 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-11-28 20:19:23,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:19:23,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-11-28 20:19:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:23,148 INFO L225 Difference]: With dead ends: 104 [2019-11-28 20:19:23,149 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 20:19:23,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:19:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 20:19:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 20:19:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 20:19:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-11-28 20:19:23,152 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 94 [2019-11-28 20:19:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:23,153 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-11-28 20:19:23,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 20:19:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-11-28 20:19:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 20:19:23,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:23,154 INFO L410 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-11-28 20:19:23,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:23,360 INFO L410 AbstractCegarLoop]: === Iteration 22 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 20:19:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1646357859, now seen corresponding path program 12 times [2019-11-28 20:19:23,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:23,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935870454] [2019-11-28 20:19:23,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:23,488 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:19:23,489 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:19:23,544 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2019-11-28 20:19:23,545 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# [2019-11-28 20:19:23,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:19:23 BoogieIcfgContainer [2019-11-28 20:19:23,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:19:23,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:19:23,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:19:23,602 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:19:23,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:08" (3/4) ... [2019-11-28 20:19:23,605 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:19:23,615 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 43 could not be translated for associated CType ARRAY#_10_~INT# [2019-11-28 20:19:23,615 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2019-11-28 20:19:23,714 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:19:23,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:19:23,716 INFO L168 Benchmark]: Toolchain (without parser) took 15776.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 957.7 MB in the beginning and 888.1 MB in the end (delta: 69.6 MB). Peak memory consumption was 376.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:23,717 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:23,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.18 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:23,718 INFO L168 Benchmark]: Boogie Preprocessor took 94.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:23,719 INFO L168 Benchmark]: RCFGBuilder took 384.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:23,719 INFO L168 Benchmark]: TraceAbstraction took 14892.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 896.7 MB in the end (delta: 211.4 MB). Peak memory consumption was 381.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:23,720 INFO L168 Benchmark]: Witness Printer took 113.22 ms. Allocated memory is still 1.3 GB. Free memory was 896.7 MB in the beginning and 888.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:23,722 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.18 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 384.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14892.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 896.7 MB in the end (delta: 211.4 MB). Peak memory consumption was 381.2 MB. Max. memory is 11.5 GB. * Witness Printer took 113.22 ms. Allocated memory is still 1.3 GB. Free memory was 896.7 MB in the beginning and 888.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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# - 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# * 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={11:0}] [L25] CALL, EXPR getNumbers2() VAL [array={11:0}] [L13] CALL, EXPR getNumbers() VAL [array={11:0}] [L5] int i = 0; VAL [array={11:0}, i=0] [L5] COND TRUE i < 10 VAL [array={11:0}, i=0] [L6] array[i] = i VAL [array={11:0}, i=0] [L5] ++i VAL [array={11:0}, i=1] [L5] COND TRUE i < 10 VAL [array={11:0}, i=1] [L6] array[i] = i VAL [array={11:0}, i=1] [L5] ++i VAL [array={11:0}, i=2] [L5] COND TRUE i < 10 VAL [array={11:0}, i=2] [L6] array[i] = i VAL [array={11:0}, i=2] [L5] ++i VAL [array={11:0}, i=3] [L5] COND TRUE i < 10 VAL [array={11:0}, i=3] [L6] array[i] = i VAL [array={11:0}, i=3] [L5] ++i VAL [array={11:0}, i=4] [L5] COND TRUE i < 10 VAL [array={11:0}, i=4] [L6] array[i] = i VAL [array={11:0}, i=4] [L5] ++i VAL [array={11:0}, i=5] [L5] COND TRUE i < 10 VAL [array={11:0}, i=5] [L6] array[i] = i VAL [array={11:0}, i=5] [L5] ++i VAL [array={11:0}, i=6] [L5] COND TRUE i < 10 VAL [array={11:0}, i=6] [L6] array[i] = i VAL [array={11:0}, i=6] [L5] ++i VAL [array={11:0}, i=7] [L5] COND TRUE i < 10 VAL [array={11:0}, i=7] [L6] array[i] = i VAL [array={11:0}, i=7] [L5] ++i VAL [array={11:0}, i=8] [L5] COND TRUE i < 10 VAL [array={11:0}, i=8] [L6] array[i] = i VAL [array={11:0}, i=8] [L5] ++i VAL [array={11:0}, i=9] [L5] COND TRUE i < 10 VAL [array={11:0}, i=9] [L6] array[i] = i VAL [array={11:0}, i=9] [L5] ++i VAL [array={11:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={11:0}, i=10] [L9] return array; VAL [\result={11:0}, array={11:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={11:0}, getNumbers()={11:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={11:0}, i=0, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=0, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=0, numbers={11:0}, numbers2={10:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=0, numbers={11:0}, numbers2={10:0}, numbers[i]=0] [L17] ++i VAL [array={11:0}, i=1, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=1, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=1, numbers={11:0}, numbers2={10:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=1, numbers={11:0}, numbers2={10:0}, numbers[i]=1] [L17] ++i VAL [array={11:0}, i=2, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=2, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=2, numbers={11:0}, numbers2={10:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=2, numbers={11:0}, numbers2={10:0}, numbers[i]=2] [L17] ++i VAL [array={11:0}, i=3, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=3, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=3, numbers={11:0}, numbers2={10:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=3, numbers={11:0}, numbers2={10:0}, numbers[i]=3] [L17] ++i VAL [array={11:0}, i=4, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=4, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=4, numbers={11:0}, numbers2={10:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=4, numbers={11:0}, numbers2={10:0}, numbers[i]=4] [L17] ++i VAL [array={11:0}, i=5, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=5, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=5, numbers={11:0}, numbers2={10:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=5, numbers={11:0}, numbers2={10:0}, numbers[i]=5] [L17] ++i VAL [array={11:0}, i=6, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=6, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=6, numbers={11:0}, numbers2={10:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=6, numbers={11:0}, numbers2={10:0}, numbers[i]=6] [L17] ++i VAL [array={11:0}, i=7, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=7, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=7, numbers={11:0}, numbers2={10:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=7, numbers={11:0}, numbers2={10:0}, numbers[i]=7] [L17] ++i VAL [array={11:0}, i=8, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=8, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=8, numbers={11:0}, numbers2={10:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=8, numbers={11:0}, numbers2={10:0}, numbers[i]=8] [L17] ++i VAL [array={11:0}, i=9, numbers={11:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={11:0}, i=9, numbers={11:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={11:0}, i=9, numbers={11:0}, numbers2={10:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={11:0}, i=9, numbers={11:0}, numbers2={10:0}, numbers[i]=9] [L17] ++i VAL [array={11:0}, i=10, numbers={11:0}, numbers2={10:0}] [L17] COND FALSE !(i < 10) VAL [array={11:0}, i=10, numbers={11:0}, numbers2={10:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={10:0}, array={11:0}, i=10, numbers={11:0}] [L25] RET, EXPR getNumbers2() VAL [array={11:0}, getNumbers2()={10:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 9 error locations. Result: UNSAFE, OverallTime: 14.7s, OverallIterations: 22, TraceHistogramMax: 10, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 503 SDtfs, 565 SDslu, 2872 SDs, 0 SdLazy, 2334 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1143 GetRequests, 905 SyntacticMatches, 1 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 56 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1862 NumberOfCodeBlocks, 1815 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 1726 ConstructedInterpolants, 0 QuantifiedInterpolants, 245869 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2960 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 1811/3687 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...