./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6853fb9e064ccfef5e54a8bac94eb86beeed80f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:55:04,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:55:04,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:55:04,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:55:04,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:55:04,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:55:04,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:55:04,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:55:04,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:55:04,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:55:04,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:55:04,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:55:04,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:55:04,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:55:04,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:55:04,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:55:04,391 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:55:04,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:55:04,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:55:04,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:55:04,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:55:04,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:55:04,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:55:04,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:55:04,399 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:55:04,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:55:04,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:55:04,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:55:04,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:55:04,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:55:04,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:55:04,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:55:04,403 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:55:04,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:55:04,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:55:04,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:55:04,405 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 03:55:04,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:55:04,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:55:04,414 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:55:04,414 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:55:04,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:55:04,415 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:55:04,415 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:55:04,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:55:04,415 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:55:04,415 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:55:04,415 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:55:04,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:55:04,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:55:04,416 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 03:55:04,416 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 03:55:04,416 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 03:55:04,416 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:55:04,416 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:55:04,416 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:55:04,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:55:04,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:55:04,417 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:55:04,417 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:55:04,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:55:04,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:55:04,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:55:04,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:55:04,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:55:04,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a6853fb9e064ccfef5e54a8bac94eb86beeed80f [2018-11-23 03:55:04,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:55:04,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:55:04,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:55:04,452 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:55:04,452 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:55:04,452 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.c [2018-11-23 03:55:04,487 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/data/ebe45f6f4/5326580ad2164c2b99f31419dda4a111/FLAGa59349b53 [2018-11-23 03:55:04,892 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:55:04,893 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.c [2018-11-23 03:55:04,897 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/data/ebe45f6f4/5326580ad2164c2b99f31419dda4a111/FLAGa59349b53 [2018-11-23 03:55:04,908 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/data/ebe45f6f4/5326580ad2164c2b99f31419dda4a111 [2018-11-23 03:55:04,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:55:04,911 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 03:55:04,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:55:04,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:55:04,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:55:04,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:04" (1/1) ... [2018-11-23 03:55:04,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:04, skipping insertion in model container [2018-11-23 03:55:04,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:04" (1/1) ... [2018-11-23 03:55:04,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:55:04,936 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:55:05,048 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:55:05,054 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:55:05,070 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:55:05,079 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:55:05,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05 WrapperNode [2018-11-23 03:55:05,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:55:05,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:55:05,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:55:05,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:55:05,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... [2018-11-23 03:55:05,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... [2018-11-23 03:55:05,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... [2018-11-23 03:55:05,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... [2018-11-23 03:55:05,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... [2018-11-23 03:55:05,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... [2018-11-23 03:55:05,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... [2018-11-23 03:55:05,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:55:05,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:55:05,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:55:05,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:55:05,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/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-11-23 03:55:05,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:55:05,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:55:05,192 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2018-11-23 03:55:05,192 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 03:55:05,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:55:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2018-11-23 03:55:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:55:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 03:55:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:55:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:55:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:55:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:55:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:55:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:55:05,405 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:55:05,405 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 03:55:05,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:05 BoogieIcfgContainer [2018-11-23 03:55:05,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:55:05,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:55:05,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:55:05,409 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:55:05,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:55:04" (1/3) ... [2018-11-23 03:55:05,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fe1ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:05, skipping insertion in model container [2018-11-23 03:55:05,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:05" (2/3) ... [2018-11-23 03:55:05,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fe1ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:05, skipping insertion in model container [2018-11-23 03:55:05,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:05" (3/3) ... [2018-11-23 03:55:05,412 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_false-valid-deref-write.c [2018-11-23 03:55:05,418 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:55:05,422 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-11-23 03:55:05,432 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-11-23 03:55:05,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:55:05,451 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:55:05,451 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 03:55:05,451 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:55:05,451 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:55:05,451 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:55:05,452 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:55:05,452 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:55:05,452 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:55:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-11-23 03:55:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:55:05,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:55:05,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:55:05,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 03:55:05,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:55:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1403638412, now seen corresponding path program 1 times [2018-11-23 03:55:05,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:55:05,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:55:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:55:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:55:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:55:05,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:55:05,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:55:05,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:55:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:55:05,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:55:05,570 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2018-11-23 03:55:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:55:05,582 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-23 03:55:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:55:05,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 03:55:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:55:05,589 INFO L225 Difference]: With dead ends: 52 [2018-11-23 03:55:05,589 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 03:55:05,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:55:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 03:55:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 03:55:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 03:55:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 03:55:05,614 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 10 [2018-11-23 03:55:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:55:05,615 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 03:55:05,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:55:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 03:55:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:55:05,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:55:05,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:55:05,616 INFO L423 AbstractCegarLoop]: === Iteration 2 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 03:55:05,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:55:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1403995904, now seen corresponding path program 1 times [2018-11-23 03:55:05,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:55:05,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:55:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:55:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:55:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:55:05,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:55:05,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:55:05,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:55:05,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:55:05,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:55:05,653 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 3 states. [2018-11-23 03:55:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:55:05,682 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-23 03:55:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:55:05,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 03:55:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:55:05,685 INFO L225 Difference]: With dead ends: 56 [2018-11-23 03:55:05,685 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 03:55:05,686 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-11-23 03:55:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 03:55:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-23 03:55:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 03:55:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 03:55:05,694 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2018-11-23 03:55:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:55:05,694 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 03:55:05,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:55:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 03:55:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 03:55:05,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:55:05,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:55:05,695 INFO L423 AbstractCegarLoop]: === Iteration 3 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 03:55:05,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:55:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash -571487811, now seen corresponding path program 1 times [2018-11-23 03:55:05,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:55:05,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:55:05,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:55:05,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:55:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:55:05,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:55:05,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:55:05,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:55:05,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:55:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:55:05,794 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-11-23 03:55:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:55:05,877 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 03:55:05,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:55:05,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 03:55:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:55:05,879 INFO L225 Difference]: With dead ends: 47 [2018-11-23 03:55:05,879 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 03:55:05,880 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-11-23 03:55:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 03:55:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 03:55:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 03:55:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 03:55:05,884 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-11-23 03:55:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:55:05,884 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 03:55:05,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:55:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 03:55:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 03:55:05,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:55:05,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:55:05,885 INFO L423 AbstractCegarLoop]: === Iteration 4 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 03:55:05,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:55:05,885 INFO L82 PathProgramCache]: Analyzing trace with hash -571487810, now seen corresponding path program 1 times [2018-11-23 03:55:05,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:55:05,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:55:05,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:55:05,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:55:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:55:05,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:55:05,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:55:05,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:55:05,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:55:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:55:05,942 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-11-23 03:55:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:55:06,076 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 03:55:06,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:55:06,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 03:55:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:55:06,079 INFO L225 Difference]: With dead ends: 72 [2018-11-23 03:55:06,080 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 03:55:06,080 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-11-23 03:55:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 03:55:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2018-11-23 03:55:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 03:55:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-23 03:55:06,086 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 11 [2018-11-23 03:55:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:55:06,086 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 03:55:06,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:55:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 03:55:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:55:06,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:55:06,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:55:06,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 03:55:06,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:55:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -536252953, now seen corresponding path program 1 times [2018-11-23 03:55:06,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:55:06,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:55:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:06,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:55:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:55:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:55:06,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:55:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:55:06,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:55:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:55:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:55:06,110 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 3 states. [2018-11-23 03:55:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:55:06,142 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 03:55:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:55:06,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 03:55:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:55:06,143 INFO L225 Difference]: With dead ends: 55 [2018-11-23 03:55:06,143 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 03:55:06,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:55:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 03:55:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 03:55:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 03:55:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-23 03:55:06,149 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 12 [2018-11-23 03:55:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:55:06,149 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 03:55:06,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:55:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 03:55:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:55:06,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:55:06,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:55:06,151 INFO L423 AbstractCegarLoop]: === Iteration 6 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 03:55:06,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:55:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash -536252952, now seen corresponding path program 1 times [2018-11-23 03:55:06,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:55:06,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:55:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:55:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:55:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:55:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:55:06,193 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=405, |#NULL.offset|=401, |old(#NULL.base)|=405, |old(#NULL.offset)|=401] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=405, |old(#NULL.offset)|=401] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=405, |old(#NULL.offset)|=401] [?] RET #101#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);~i~2 := 0; VAL [main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=404, |main_~#b~0.offset|=0] [?] assume !!(~i~2 < 100); VAL [main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=404, |main_~#b~0.offset|=0] [?] CALL call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1] [?] ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~n);havoc ~i~1;~i~1 := 0; VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] assume !!(~i~1 < ~size); VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~b.base, ~b.offset + 4 * ~i~1, 4); srcloc: L23 VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_#t~mem3|=402, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] assume !(4 + (~#a~0.offset + 4 * ~i~1) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~1); VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_#t~mem3|=402, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=405, #NULL.offset=401, old(#NULL.base)=405, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L32] havoc ~i~2; [L32] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L33-L35] assume !!(~i~2 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L20-L29] ~size := #in~size; [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] assume !!(~i~1 < ~size); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call #t~mem3 := read~int(~b.base, ~b.offset + 4 * ~i~1, 4); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=405, #NULL.offset=401, old(#NULL.base)=405, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L32] havoc ~i~2; [L32] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L33-L35] assume !!(~i~2 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L20-L29] ~size := #in~size; [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] assume !!(~i~1 < ~size); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call #t~mem3 := read~int(~b.base, ~b.offset + 4 * ~i~1, 4); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=405, #NULL!offset=401, old(#NULL!base)=405, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=405, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0, 1 + ~i~2); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=405, #NULL!offset=401, old(#NULL!base)=405, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=405, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0, 1 + ~i~2); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L32] int i, b[100]; [L33] i = 0 VAL [b={404:0}, i=0] [L33] COND TRUE i < 100 VAL [b={404:0}, i=0] [L34] CALL foo(i, b, i + 1) VAL [\old(n)=0, \old(size)=1, b={404:0}] [L21] int a[n], i; [L22] i = 0 VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, i=0, n=0, size=1] [L22] COND TRUE i < size VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, i=0, n=0, size=1] [L23] EXPR b[i] VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, b[i]=402, i=0, n=0, size=1] [L23] a[i] = b[i] ----- [2018-11-23 03:55:06,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:55:06 BoogieIcfgContainer [2018-11-23 03:55:06,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:55:06,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:55:06,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:55:06,221 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:55:06,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:05" (3/4) ... [2018-11-23 03:55:06,223 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=405, |#NULL.offset|=401, |old(#NULL.base)|=405, |old(#NULL.offset)|=401] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=405, |old(#NULL.offset)|=401] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=405, |old(#NULL.offset)|=401] [?] RET #101#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);~i~2 := 0; VAL [main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=404, |main_~#b~0.offset|=0] [?] assume !!(~i~2 < 100); VAL [main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=404, |main_~#b~0.offset|=0] [?] CALL call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1] [?] ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~n);havoc ~i~1;~i~1 := 0; VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] assume !!(~i~1 < ~size); VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~b.base, ~b.offset + 4 * ~i~1, 4); srcloc: L23 VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_#t~mem3|=402, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] assume !(4 + (~#a~0.offset + 4 * ~i~1) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~1); VAL [foo_~b.base=404, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=404, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=1, |foo_#t~mem3|=402, |foo_~#a~0.base|=403, |foo_~#a~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=405, #NULL.offset=401, old(#NULL.base)=405, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L32] havoc ~i~2; [L32] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L33-L35] assume !!(~i~2 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L20-L29] ~size := #in~size; [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] assume !!(~i~1 < ~size); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call #t~mem3 := read~int(~b.base, ~b.offset + 4 * ~i~1, 4); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=405, #NULL.offset=401, old(#NULL.base)=405, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=405, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L32] havoc ~i~2; [L32] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L33-L35] assume !!(~i~2 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=404, ~#b~0.offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L20-L29] ~size := #in~size; [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] assume !!(~i~1 < ~size); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call #t~mem3 := read~int(~b.base, ~b.offset + 4 * ~i~1, 4); VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [L23] call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b.base=404, #in~b.offset=0, #in~n=0, #in~size=1, #NULL.base=0, #NULL.offset=0, #t~mem3=402, ~#a~0.base=403, ~#a~0.offset=0, ~b.base=404, ~b.offset=0, ~i~1=0, ~n=0, ~size=1] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=405, #NULL!offset=401, old(#NULL!base)=405, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=405, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0, 1 + ~i~2); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=405, #NULL!offset=401, old(#NULL!base)=405, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=405, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=404, ~#b~0!offset=0, ~i~2=0] [L34] CALL call #t~ret6 := foo(~i~2, ~#b~0, 1 + ~i~2); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0] [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#in~b!base=404, #in~b!offset=0, #in~n=0, #in~size=1, #NULL!base=0, #NULL!offset=0, #t~mem3=402, ~#a~0!base=403, ~#a~0!offset=0, ~b!base=404, ~b!offset=0, ~i~1=0, ~n=0, ~size=1] [L32] int i, b[100]; [L33] i = 0 VAL [b={404:0}, i=0] [L33] COND TRUE i < 100 VAL [b={404:0}, i=0] [L34] CALL foo(i, b, i + 1) VAL [\old(n)=0, \old(size)=1, b={404:0}] [L21] int a[n], i; [L22] i = 0 VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, i=0, n=0, size=1] [L22] COND TRUE i < size VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, i=0, n=0, size=1] [L23] EXPR b[i] VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, b[i]=402, i=0, n=0, size=1] [L23] a[i] = b[i] ----- [2018-11-23 03:55:06,254 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d066b6af-cfa3-4e1d-a974-ca06c23a1fa3/bin-2019/uautomizer/witness.graphml [2018-11-23 03:55:06,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:55:06,255 INFO L168 Benchmark]: Toolchain (without parser) took 1344.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -86.0 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:55:06,256 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:55:06,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.61 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:55:06,256 INFO L168 Benchmark]: Boogie Preprocessor took 67.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:55:06,257 INFO L168 Benchmark]: RCFGBuilder took 257.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:55:06,257 INFO L168 Benchmark]: TraceAbstraction took 814.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:55:06,257 INFO L168 Benchmark]: Witness Printer took 33.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:55:06,259 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.61 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 814.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. * Witness Printer took 33.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 23]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L32] int i, b[100]; [L33] i = 0 VAL [b={404:0}, i=0] [L33] COND TRUE i < 100 VAL [b={404:0}, i=0] [L34] CALL foo(i, b, i + 1) VAL [\old(n)=0, \old(size)=1, b={404:0}] [L21] int a[n], i; [L22] i = 0 VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, i=0, n=0, size=1] [L22] COND TRUE i < size VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, i=0, n=0, size=1] [L23] EXPR b[i] VAL [\old(n)=0, \old(size)=1, a={403:0}, b={404:0}, b={404:0}, b[i]=402, i=0, n=0, size=1] [L23] a[i] = b[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 52 locations, 11 error locations. UNSAFE Result, 0.7s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 75 SDslu, 214 SDs, 0 SdLazy, 169 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 1443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...