./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44846bb6d84d04329b704265dd9929c19b9c8486 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:01:54,186 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:01:54,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:01:54,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:01:54,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:01:54,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:01:54,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:01:54,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:01:54,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:01:54,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:01:54,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:01:54,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:01:54,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:01:54,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:01:54,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:01:54,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:01:54,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:01:54,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:01:54,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:01:54,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:01:54,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:01:54,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:01:54,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:01:54,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:01:54,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:01:54,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:01:54,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:01:54,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:01:54,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:01:54,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:01:54,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:01:54,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:01:54,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:01:54,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:01:54,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:01:54,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:01:54,209 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 02:01:54,217 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:01:54,217 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:01:54,217 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:01:54,217 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:01:54,217 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:01:54,218 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:01:54,218 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:01:54,218 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:01:54,218 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:01:54,218 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:01:54,218 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:01:54,218 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:01:54,218 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:01:54,219 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 02:01:54,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 02:01:54,219 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:01:54,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:01:54,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:01:54,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:01:54,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:01:54,221 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan 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 -> Taipan 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 -> 44846bb6d84d04329b704265dd9929c19b9c8486 [2018-12-03 02:01:54,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:01:54,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:01:54,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:01:54,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:01:54,248 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:01:54,248 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-03 02:01:54,283 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/data/260104b8b/91eadc8bd2cf42a895611115af988409/FLAG7f51ac187 [2018-12-03 02:01:54,733 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:01:54,733 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-03 02:01:54,739 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/data/260104b8b/91eadc8bd2cf42a895611115af988409/FLAG7f51ac187 [2018-12-03 02:01:54,747 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/data/260104b8b/91eadc8bd2cf42a895611115af988409 [2018-12-03 02:01:54,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:01:54,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:01:54,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:01:54,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:01:54,752 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:01:54,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:54,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178df10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54, skipping insertion in model container [2018-12-03 02:01:54,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:54,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:01:54,775 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:01:54,913 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:01:54,919 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:01:54,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:01:54,993 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:01:54,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54 WrapperNode [2018-12-03 02:01:54,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:01:54,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:01:54,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:01:54,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:01:54,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:01:55,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:01:55,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:01:55,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:01:55,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... [2018-12-03 02:01:55,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:01:55,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:01:55,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:01:55,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:01:55,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/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 [2018-12-03 02:01:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:01:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 02:01:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:01:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:01:55,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:01:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:01:55,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:01:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-12-03 02:01:55,062 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-12-03 02:01:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:01:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:01:55,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:01:55,213 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:01:55,213 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 02:01:55,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:01:55 BoogieIcfgContainer [2018-12-03 02:01:55,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:01:55,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:01:55,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:01:55,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:01:55,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:01:54" (1/3) ... [2018-12-03 02:01:55,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27598f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:01:55, skipping insertion in model container [2018-12-03 02:01:55,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:54" (2/3) ... [2018-12-03 02:01:55,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27598f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:01:55, skipping insertion in model container [2018-12-03 02:01:55,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:01:55" (3/3) ... [2018-12-03 02:01:55,218 INFO L112 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-03 02:01:55,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:01:55,229 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-03 02:01:55,239 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-03 02:01:55,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:01:55,255 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 02:01:55,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:01:55,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:01:55,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:01:55,256 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:01:55,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:01:55,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:01:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-12-03 02:01:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 02:01:55,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:55,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:55,271 INFO L423 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:55,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1189937009, now seen corresponding path program 1 times [2018-12-03 02:01:55,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:55,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:55,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:55,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:55,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:55,401 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-12-03 02:01:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:55,472 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-03 02:01:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:01:55,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 02:01:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:55,480 INFO L225 Difference]: With dead ends: 37 [2018-12-03 02:01:55,481 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 02:01:55,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:01:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 02:01:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 02:01:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 02:01:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-12-03 02:01:55,509 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 13 [2018-12-03 02:01:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:55,510 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-12-03 02:01:55,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-12-03 02:01:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 02:01:55,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:55,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:55,510 INFO L423 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:55,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1189937008, now seen corresponding path program 1 times [2018-12-03 02:01:55,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:55,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:55,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:01:55,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:55,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:01:55,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:01:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:01:55,538 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 3 states. [2018-12-03 02:01:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:55,549 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-03 02:01:55,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:01:55,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 02:01:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:55,550 INFO L225 Difference]: With dead ends: 35 [2018-12-03 02:01:55,550 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 02:01:55,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:01:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 02:01:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 02:01:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 02:01:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-12-03 02:01:55,555 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 13 [2018-12-03 02:01:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:55,555 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-12-03 02:01:55,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:01:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-12-03 02:01:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 02:01:55,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:55,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:55,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:55,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1189936962, now seen corresponding path program 1 times [2018-12-03 02:01:55,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:55,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:55,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:01:55,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:55,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:01:55,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:01:55,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:01:55,599 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-12-03 02:01:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:55,643 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-12-03 02:01:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:01:55,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-03 02:01:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:55,646 INFO L225 Difference]: With dead ends: 47 [2018-12-03 02:01:55,646 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 02:01:55,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:01:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 02:01:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-12-03 02:01:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 02:01:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-03 02:01:55,651 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-12-03 02:01:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:55,651 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-03 02:01:55,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:01:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-03 02:01:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 02:01:55,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:55,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:55,652 INFO L423 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:55,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 585070400, now seen corresponding path program 1 times [2018-12-03 02:01:55,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:55,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:55,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:55,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:01:55,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:55,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:01:55,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:01:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:01:55,724 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2018-12-03 02:01:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:55,847 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-12-03 02:01:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:01:55,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-03 02:01:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:55,848 INFO L225 Difference]: With dead ends: 65 [2018-12-03 02:01:55,848 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 02:01:55,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:01:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 02:01:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2018-12-03 02:01:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 02:01:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 02:01:55,852 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 13 [2018-12-03 02:01:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:55,852 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 02:01:55,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:01:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 02:01:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 02:01:55,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:55,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:55,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:55,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash 957313178, now seen corresponding path program 1 times [2018-12-03 02:01:55,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:55,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:55,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:55,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:55,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:01:55,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:55,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:01:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:01:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:01:55,893 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 7 states. [2018-12-03 02:01:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:55,988 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-12-03 02:01:55,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:01:55,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-03 02:01:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:55,990 INFO L225 Difference]: With dead ends: 78 [2018-12-03 02:01:55,990 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 02:01:55,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:01:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 02:01:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-12-03 02:01:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 02:01:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-12-03 02:01:55,995 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 14 [2018-12-03 02:01:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:55,995 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-12-03 02:01:55,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:01:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-12-03 02:01:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 02:01:55,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:55,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:55,996 INFO L423 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:55,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1068840272, now seen corresponding path program 1 times [2018-12-03 02:01:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:55,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:56,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:56,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:01:56,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:56,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:56,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:56,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:56,031 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 4 states. [2018-12-03 02:01:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:56,063 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-12-03 02:01:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:01:56,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 02:01:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:56,064 INFO L225 Difference]: With dead ends: 58 [2018-12-03 02:01:56,064 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 02:01:56,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 02:01:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 02:01:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 02:01:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 02:01:56,066 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 15 [2018-12-03 02:01:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:56,066 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 02:01:56,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 02:01:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 02:01:56,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:56,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:56,067 INFO L423 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:56,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1279402257, now seen corresponding path program 1 times [2018-12-03 02:01:56,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:56,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:56,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:56,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:56,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:56,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:56,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:01:56,122 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 02:01:56,123 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [16], [18], [19], [22], [27], [31], [37], [58], [63], [65], [70], [71], [72], [74] [2018-12-03 02:01:56,142 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:01:56,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:01:56,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:01:56,272 INFO L272 AbstractInterpreter]: Visited 18 different actions 39 times. Merged at 7 different actions 21 times. Widened at 1 different actions 1 times. Performed 260 root evaluator evaluations with a maximum evaluation depth of 4. Performed 260 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-03 02:01:56,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:56,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:01:56,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:56,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:01:56,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:56,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:01:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:56,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:01:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:56,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:01:56,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 02:01:56,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:01:56,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-03 02:01:56,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:01:56,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 02:01:56,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-12-03 02:01:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:56,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:01:56,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-12-03 02:01:56,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:01:56,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:01:56,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:01:56,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:01:56,476 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 12 states. [2018-12-03 02:01:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:56,656 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-12-03 02:01:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:01:56,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-03 02:01:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:56,657 INFO L225 Difference]: With dead ends: 60 [2018-12-03 02:01:56,657 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 02:01:56,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-12-03 02:01:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 02:01:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-12-03 02:01:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 02:01:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-03 02:01:56,660 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 18 [2018-12-03 02:01:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:56,660 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-03 02:01:56,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:01:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-03 02:01:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 02:01:56,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:56,660 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:56,661 INFO L423 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:56,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1006765691, now seen corresponding path program 1 times [2018-12-03 02:01:56,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:56,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:56,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:56,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:56,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:56,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:56,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:01:56,701 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 02:01:56,702 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [18], [19], [22], [24], [27], [31], [58], [63], [65], [70], [71], [72], [74] [2018-12-03 02:01:56,703 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:01:56,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:01:56,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:01:56,748 INFO L272 AbstractInterpreter]: Visited 17 different actions 40 times. Merged at 6 different actions 23 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 4. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-03 02:01:56,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:56,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:01:56,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:56,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:01:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:56,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:01:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:56,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:01:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:56,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:01:56,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 02:01:56,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:01:56,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-03 02:01:56,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:01:56,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 02:01:56,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-12-03 02:01:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:56,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:01:56,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2018-12-03 02:01:56,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:01:56,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:01:56,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:01:56,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:01:56,939 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 13 states. [2018-12-03 02:01:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:57,106 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-12-03 02:01:57,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:01:57,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-12-03 02:01:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:57,106 INFO L225 Difference]: With dead ends: 77 [2018-12-03 02:01:57,106 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 02:01:57,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-12-03 02:01:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 02:01:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 44. [2018-12-03 02:01:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 02:01:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 02:01:57,109 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2018-12-03 02:01:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:57,109 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 02:01:57,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:01:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 02:01:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 02:01:57,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:57,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:57,110 INFO L423 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:57,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1144921618, now seen corresponding path program 1 times [2018-12-03 02:01:57,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:57,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:57,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:57,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:57,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:57,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:57,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:01:57,144 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 02:01:57,144 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [16], [18], [19], [22], [27], [31], [35], [38], [41], [58], [63], [65], [70], [71], [72], [74] [2018-12-03 02:01:57,145 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:01:57,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:01:57,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:01:57,181 INFO L272 AbstractInterpreter]: Visited 20 different actions 47 times. Merged at 9 different actions 27 times. Widened at 1 different actions 1 times. Performed 320 root evaluator evaluations with a maximum evaluation depth of 4. Performed 320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-03 02:01:57,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:57,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:01:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:57,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:01:57,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:57,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:01:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:57,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:01:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:57,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:01:57,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-03 02:01:57,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:01:57,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:01:57,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-03 02:01:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:57,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:01:57,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2018-12-03 02:01:57,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:01:57,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:01:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:01:57,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:01:57,348 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 12 states. [2018-12-03 02:01:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:57,487 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-12-03 02:01:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:01:57,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-12-03 02:01:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:57,488 INFO L225 Difference]: With dead ends: 61 [2018-12-03 02:01:57,488 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 02:01:57,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-12-03 02:01:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 02:01:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2018-12-03 02:01:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 02:01:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-03 02:01:57,490 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-12-03 02:01:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:57,490 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-03 02:01:57,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:01:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-03 02:01:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 02:01:57,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:57,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:57,491 INFO L423 AbstractCegarLoop]: === Iteration 10 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:57,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:57,491 INFO L82 PathProgramCache]: Analyzing trace with hash -125446122, now seen corresponding path program 1 times [2018-12-03 02:01:57,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:57,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:57,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:57,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:57,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:01:57,523 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-03 02:01:57,524 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [16], [18], [19], [21], [22], [27], [31], [35], [38], [39], [42], [45], [46], [50], [58], [63], [65], [70], [71], [72], [74] [2018-12-03 02:01:57,525 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:01:57,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:01:57,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:01:57,602 INFO L272 AbstractInterpreter]: Visited 25 different actions 83 times. Merged at 15 different actions 54 times. Widened at 2 different actions 2 times. Performed 632 root evaluator evaluations with a maximum evaluation depth of 4. Performed 632 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 2 different actions. Largest state had 26 variables. [2018-12-03 02:01:57,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:57,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:01:57,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:57,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:01:57,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:57,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:01:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:57,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:01:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:57,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:01:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:57,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:01:57,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 02:01:57,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:01:57,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:01:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:01:57,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:01:57,665 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-12-03 02:01:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:57,700 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-12-03 02:01:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:01:57,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-03 02:01:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:57,701 INFO L225 Difference]: With dead ends: 60 [2018-12-03 02:01:57,701 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 02:01:57,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:01:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 02:01:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2018-12-03 02:01:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 02:01:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-12-03 02:01:57,703 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 27 [2018-12-03 02:01:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:57,704 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-03 02:01:57,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:01:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-12-03 02:01:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 02:01:57,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:57,705 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:57,705 INFO L423 AbstractCegarLoop]: === Iteration 11 === [SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:01:57,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:57,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1763416021, now seen corresponding path program 2 times [2018-12-03 02:01:57,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:57,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:57,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:57,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:57,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:01:57,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 02:01:57,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 02:01:57,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:01:57,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:01:57,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 02:01:57,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 02:01:57,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 02:01:57,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 02:01:57,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:01:57,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 02:01:57,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:01:57,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:01:57,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 02:01:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 02:01:57,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:01:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 02:01:57,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:01:57,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2018-12-03 02:01:57,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:01:57,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:01:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:01:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:01:57,998 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 13 states. [2018-12-03 02:01:58,302 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-03 02:01:58,531 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 02:01:58,869 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 02:01:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:58,959 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-12-03 02:01:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:01:58,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-12-03 02:01:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:58,960 INFO L225 Difference]: With dead ends: 48 [2018-12-03 02:01:58,960 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 02:01:58,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2018-12-03 02:01:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 02:01:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 02:01:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 02:01:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 02:01:58,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-03 02:01:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:58,961 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 02:01:58,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:01:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 02:01:58,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 02:01:58,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:01:58 BoogieIcfgContainer [2018-12-03 02:01:58,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:01:58,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:01:58,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:01:58,964 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:01:58,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:01:55" (3/4) ... [2018-12-03 02:01:58,967 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 02:01:58,970 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 02:01:58,970 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SelectionSort [2018-12-03 02:01:58,970 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 02:01:58,973 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-03 02:01:58,973 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-03 02:01:58,973 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 02:01:58,998 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2e4dc251-7e4f-4c76-b533-38122fcc9116/bin-2019/utaipan/witness.graphml [2018-12-03 02:01:58,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:01:58,998 INFO L168 Benchmark]: Toolchain (without parser) took 4249.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 953.5 MB in the beginning and 818.4 MB in the end (delta: 135.1 MB). Peak memory consumption was 354.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:58,999 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:01:58,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:58,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.12 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:59,000 INFO L168 Benchmark]: Boogie Preprocessor took 16.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:01:59,000 INFO L168 Benchmark]: RCFGBuilder took 185.44 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:59,000 INFO L168 Benchmark]: TraceAbstraction took 3749.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 818.4 MB in the end (delta: 285.1 MB). Peak memory consumption was 363.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:59,000 INFO L168 Benchmark]: Witness Printer took 33.96 ms. Allocated memory is still 1.2 GB. Free memory is still 818.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:01:59,001 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.12 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 185.44 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3749.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 818.4 MB in the end (delta: 285.1 MB). Peak memory consumption was 363.7 MB. Max. memory is 11.5 GB. * Witness Printer took 33.96 ms. Allocated memory is still 1.2 GB. Free memory is still 818.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 13 error locations. SAFE Result, 3.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 772 SDslu, 699 SDs, 0 SdLazy, 1006 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 198 SyntacticMatches, 6 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 128 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 313 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 408 ConstructedInterpolants, 56 QuantifiedInterpolants, 82914 SizeOfPredicates, 30 NumberOfNonLiveVariables, 487 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 36/69 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...