./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/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 ab87ef7cc863b18816ae397a50b6c6e9fb3e753d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:15:29,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:15:29,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:15:29,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:15:29,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:15:29,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:15:29,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:15:29,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:15:29,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:15:29,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:15:29,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:15:29,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:15:29,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:15:29,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:15:29,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:15:29,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:15:29,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:15:29,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:15:29,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:15:29,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:15:29,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:15:29,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:15:29,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:15:29,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:15:29,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:15:29,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:15:29,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:15:29,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:15:29,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:15:29,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:15:29,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:15:29,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:15:29,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:15:29,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:15:29,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:15:29,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:15:29,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:15:29,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:15:29,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:15:29,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:15:29,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:15:29,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:15:29,292 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:15:29,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:15:29,292 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:15:29,293 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:15:29,293 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:15:29,293 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:15:29,293 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:15:29,293 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:15:29,294 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:15:29,294 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:15:29,294 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:15:29,294 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:15:29,294 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:15:29,295 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:15:29,295 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:15:29,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:15:29,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:15:29,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:15:29,296 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:15:29,296 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:15:29,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:15:29,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:15:29,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:15:29,297 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:15:29,297 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:15:29,297 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:15:29,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:15:29,297 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:15:29,298 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:15:29,298 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:15:29,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:15:29,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:15:29,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:15:29,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:15:29,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:15:29,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:15:29,299 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:15:29,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:15:29,299 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:15:29,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:15:29,299 INFO L138 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/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/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 -> ab87ef7cc863b18816ae397a50b6c6e9fb3e753d [2019-12-07 11:15:29,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:15:29,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:15:29,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:15:29,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:15:29,425 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:15:29,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-12-07 11:15:29,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/data/4535c1495/69dcf232da354d418aae0a0bec60b845/FLAGb8cb26463 [2019-12-07 11:15:29,904 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:15:29,904 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-12-07 11:15:29,913 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/data/4535c1495/69dcf232da354d418aae0a0bec60b845/FLAGb8cb26463 [2019-12-07 11:15:29,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/data/4535c1495/69dcf232da354d418aae0a0bec60b845 [2019-12-07 11:15:29,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:15:29,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:15:29,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:15:29,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:15:29,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:15:29,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:29" (1/1) ... [2019-12-07 11:15:29,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27669dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:29, skipping insertion in model container [2019-12-07 11:15:29,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:29" (1/1) ... [2019-12-07 11:15:29,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:15:29,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:15:30,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:15:30,181 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:15:30,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:15:30,237 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:15:30,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30 WrapperNode [2019-12-07 11:15:30,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:15:30,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:15:30,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:15:30,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:15:30,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:15:30,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:15:30,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:15:30,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:15:30,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... [2019-12-07 11:15:30,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:15:30,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:15:30,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:15:30,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:15:30,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/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 [2019-12-07 11:15:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:15:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:15:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:15:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:15:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:15:30,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:15:30,574 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:15:30,574 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:15:30,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:30 BoogieIcfgContainer [2019-12-07 11:15:30,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:15:30,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:15:30,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:15:30,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:15:30,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:15:29" (1/3) ... [2019-12-07 11:15:30,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261f1ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:15:30, skipping insertion in model container [2019-12-07 11:15:30,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:30" (2/3) ... [2019-12-07 11:15:30,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261f1ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:15:30, skipping insertion in model container [2019-12-07 11:15:30,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:30" (3/3) ... [2019-12-07 11:15:30,580 INFO L109 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2019-12-07 11:15:30,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:15:30,591 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-12-07 11:15:30,598 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-12-07 11:15:30,611 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:15:30,611 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:15:30,611 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:15:30,611 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:15:30,611 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:15:30,611 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:15:30,612 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:15:30,612 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:15:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-12-07 11:15:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:15:30,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:30,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:15:30,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash 3321, now seen corresponding path program 1 times [2019-12-07 11:15:30,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:30,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881715898] [2019-12-07 11:15:30,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:30,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881715898] [2019-12-07 11:15:30,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:30,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:30,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905657149] [2019-12-07 11:15:30,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:30,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:30,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:30,788 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2019-12-07 11:15:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:30,850 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-12-07 11:15:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:30,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:15:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:30,860 INFO L225 Difference]: With dead ends: 46 [2019-12-07 11:15:30,860 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 11:15:30,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 11:15:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 11:15:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:15:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-12-07 11:15:30,891 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 2 [2019-12-07 11:15:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:30,892 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-12-07 11:15:30,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-12-07 11:15:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:15:30,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:30,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:15:30,892 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 3322, now seen corresponding path program 1 times [2019-12-07 11:15:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:30,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912060926] [2019-12-07 11:15:30,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:30,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912060926] [2019-12-07 11:15:30,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:30,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:30,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303089238] [2019-12-07 11:15:30,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:30,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:30,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:30,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:30,941 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 3 states. [2019-12-07 11:15:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:30,976 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-12-07 11:15:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:30,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:15:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:30,977 INFO L225 Difference]: With dead ends: 40 [2019-12-07 11:15:30,977 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 11:15:30,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 11:15:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 11:15:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 11:15:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-12-07 11:15:30,981 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 2 [2019-12-07 11:15:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:30,981 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-12-07 11:15:30,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-12-07 11:15:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:15:30,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:30,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:15:30,982 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash 102927, now seen corresponding path program 1 times [2019-12-07 11:15:30,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:30,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65393812] [2019-12-07 11:15:30,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:31,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65393812] [2019-12-07 11:15:31,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:31,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:31,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862242073] [2019-12-07 11:15:31,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:31,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,016 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 3 states. [2019-12-07 11:15:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:31,046 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-12-07 11:15:31,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:31,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:15:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:31,047 INFO L225 Difference]: With dead ends: 38 [2019-12-07 11:15:31,047 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 11:15:31,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 11:15:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 11:15:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 11:15:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 11:15:31,050 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 3 [2019-12-07 11:15:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:31,050 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 11:15:31,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 11:15:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:15:31,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:31,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:15:31,050 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 102928, now seen corresponding path program 1 times [2019-12-07 11:15:31,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:31,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483770017] [2019-12-07 11:15:31,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:31,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483770017] [2019-12-07 11:15:31,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:31,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:31,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646316396] [2019-12-07 11:15:31,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:31,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,085 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2019-12-07 11:15:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:31,109 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 11:15:31,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:31,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:15:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:31,110 INFO L225 Difference]: With dead ends: 36 [2019-12-07 11:15:31,110 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 11:15:31,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 11:15:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 11:15:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 11:15:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-12-07 11:15:31,113 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 3 [2019-12-07 11:15:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:31,113 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-12-07 11:15:31,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-12-07 11:15:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:15:31,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:31,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:15:31,113 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash 3190716, now seen corresponding path program 1 times [2019-12-07 11:15:31,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:31,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402671197] [2019-12-07 11:15:31,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:31,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402671197] [2019-12-07 11:15:31,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:31,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:31,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697151592] [2019-12-07 11:15:31,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:31,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:31,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:31,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,135 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 3 states. [2019-12-07 11:15:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:31,163 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-12-07 11:15:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:31,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 11:15:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:31,164 INFO L225 Difference]: With dead ends: 32 [2019-12-07 11:15:31,164 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 11:15:31,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 11:15:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 11:15:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 11:15:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 11:15:31,166 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 4 [2019-12-07 11:15:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:31,167 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 11:15:31,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 11:15:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:15:31,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:31,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:15:31,167 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash 3190717, now seen corresponding path program 1 times [2019-12-07 11:15:31,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:31,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537944767] [2019-12-07 11:15:31,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:31,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537944767] [2019-12-07 11:15:31,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:31,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:31,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672553949] [2019-12-07 11:15:31,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:31,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:31,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,199 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 3 states. [2019-12-07 11:15:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:31,221 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-12-07 11:15:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:31,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 11:15:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:31,222 INFO L225 Difference]: With dead ends: 28 [2019-12-07 11:15:31,222 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 11:15:31,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 11:15:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 11:15:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 11:15:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-12-07 11:15:31,225 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2019-12-07 11:15:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:31,226 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-12-07 11:15:31,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-12-07 11:15:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:15:31,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:31,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:15:31,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 98912178, now seen corresponding path program 1 times [2019-12-07 11:15:31,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:31,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068279705] [2019-12-07 11:15:31,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:31,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068279705] [2019-12-07 11:15:31,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:31,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:31,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608809186] [2019-12-07 11:15:31,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:31,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,257 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2019-12-07 11:15:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:31,277 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 11:15:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:31,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:15:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:31,278 INFO L225 Difference]: With dead ends: 24 [2019-12-07 11:15:31,278 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 11:15:31,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 11:15:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 11:15:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 11:15:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 11:15:31,280 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 5 [2019-12-07 11:15:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:31,280 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 11:15:31,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-12-07 11:15:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:15:31,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:31,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:15:31,281 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:31,281 INFO L82 PathProgramCache]: Analyzing trace with hash 98912179, now seen corresponding path program 1 times [2019-12-07 11:15:31,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:31,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351379893] [2019-12-07 11:15:31,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:31,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351379893] [2019-12-07 11:15:31,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:31,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:31,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734201677] [2019-12-07 11:15:31,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:31,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,310 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2019-12-07 11:15:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:31,327 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-12-07 11:15:31,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:31,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:15:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:31,328 INFO L225 Difference]: With dead ends: 20 [2019-12-07 11:15:31,328 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:15:31,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:15:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 11:15:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:15:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 11:15:31,329 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2019-12-07 11:15:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:31,330 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 11:15:31,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 11:15:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:15:31,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:31,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:31,330 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:15:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash 946801889, now seen corresponding path program 1 times [2019-12-07 11:15:31,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:31,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350890648] [2019-12-07 11:15:31,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:31,554 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 34 [2019-12-07 11:15:31,712 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 31 [2019-12-07 11:15:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:31,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350890648] [2019-12-07 11:15:31,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:31,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:15:31,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960023517] [2019-12-07 11:15:31,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:31,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:31,745 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-12-07 11:15:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:31,796 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-12-07 11:15:31,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:15:31,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 11:15:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:31,797 INFO L225 Difference]: With dead ends: 19 [2019-12-07 11:15:31,797 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:15:31,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:15:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:15:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:15:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:15:31,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-12-07 11:15:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:31,798 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:15:31,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:15:31,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:15:31,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:15:31 BoogieIcfgContainer [2019-12-07 11:15:31,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:15:31,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:15:31,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:15:31,803 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:15:31,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:30" (3/4) ... [2019-12-07 11:15:31,807 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:15:31,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 11:15:31,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 11:15:31,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:15:31,859 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_01492f64-f10e-4acd-b81a-51b86084597f/bin/utaipan/witness.graphml [2019-12-07 11:15:31,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:15:31,861 INFO L168 Benchmark]: Toolchain (without parser) took 1936.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 942.5 MB in the beginning and 858.2 MB in the end (delta: 84.3 MB). Peak memory consumption was 192.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:31,861 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:31,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:31,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:31,862 INFO L168 Benchmark]: Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:31,863 INFO L168 Benchmark]: RCFGBuilder took 291.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:31,863 INFO L168 Benchmark]: TraceAbstraction took 1226.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 863.5 MB in the end (delta: 189.9 MB). Peak memory consumption was 189.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:31,864 INFO L168 Benchmark]: Witness Printer took 57.10 ms. Allocated memory is still 1.1 GB. Free memory was 863.5 MB in the beginning and 858.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:31,866 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 291.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1226.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 863.5 MB in the end (delta: 189.9 MB). Peak memory consumption was 189.9 MB. Max. memory is 11.5 GB. * Witness Printer took 57.10 ms. Allocated memory is still 1.1 GB. Free memory was 863.5 MB in the beginning and 858.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 31 error locations. Result: SAFE, OverallTime: 1.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 98 SDtfs, 272 SDslu, 4 SDs, 0 SdLazy, 219 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 5145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...