./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56b28f59847d63942ec468b0c95f39e5b8c0763a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:04:12,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:04:12,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:04:12,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:04:12,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:04:12,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:04:12,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:04:12,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:04:12,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:04:12,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:04:12,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:04:12,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:04:12,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:04:12,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:04:12,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:04:12,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:04:12,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:04:12,832 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:04:12,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:04:12,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:04:12,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:04:12,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:04:12,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:04:12,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:04:12,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:04:12,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:04:12,840 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:04:12,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:04:12,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:04:12,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:04:12,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:04:12,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:04:12,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:04:12,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:04:12,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:04:12,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:04:12,844 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 08:04:12,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:04:12,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:04:12,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:04:12,855 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 08:04:12,855 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 08:04:12,856 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 08:04:12,856 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 08:04:12,856 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 08:04:12,856 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 08:04:12,856 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 08:04:12,856 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 08:04:12,856 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:04:12,857 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:04:12,857 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:04:12,857 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:04:12,857 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:04:12,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:04:12,857 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:04:12,858 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:04:12,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:04:12,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:04:12,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:04:12,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:04:12,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:04:12,859 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 08:04:12,859 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:04:12,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:04:12,859 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2018-11-10 08:04:12,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:04:12,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:04:12,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:04:12,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:04:12,892 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:04:12,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-10 08:04:12,929 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/data/d69d37634/828b0f29f35e4de2a46ca44c94edb85f/FLAG3aa1a2aae [2018-11-10 08:04:13,347 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:04:13,348 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-10 08:04:13,352 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/data/d69d37634/828b0f29f35e4de2a46ca44c94edb85f/FLAG3aa1a2aae [2018-11-10 08:04:13,361 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/data/d69d37634/828b0f29f35e4de2a46ca44c94edb85f [2018-11-10 08:04:13,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:04:13,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:04:13,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:04:13,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:04:13,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:04:13,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ba6664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13, skipping insertion in model container [2018-11-10 08:04:13,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:04:13,388 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:04:13,488 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:04:13,494 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:04:13,505 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:04:13,515 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:04:13,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13 WrapperNode [2018-11-10 08:04:13,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:04:13,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:04:13,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:04:13,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:04:13,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:04:13,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:04:13,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:04:13,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:04:13,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... [2018-11-10 08:04:13,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:04:13,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:04:13,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:04:13,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:04:13,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:04:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:04:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:04:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 08:04:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 08:04:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:04:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:04:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:04:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:04:13,793 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:04:13,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:04:13 BoogieIcfgContainer [2018-11-10 08:04:13,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:04:13,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:04:13,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:04:13,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:04:13,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:04:13" (1/3) ... [2018-11-10 08:04:13,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfe6835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:04:13, skipping insertion in model container [2018-11-10 08:04:13,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:13" (2/3) ... [2018-11-10 08:04:13,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfe6835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:04:13, skipping insertion in model container [2018-11-10 08:04:13,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:04:13" (3/3) ... [2018-11-10 08:04:13,798 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-10 08:04:13,804 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:04:13,809 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 08:04:13,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 08:04:13,838 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:04:13,838 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 08:04:13,838 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:04:13,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:04:13,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:04:13,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:04:13,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:04:13,839 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:04:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 08:04:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 08:04:13,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:13,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:13,855 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:13,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:13,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-11-10 08:04:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:13,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:13,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:13,943 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-10 08:04:13,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:13,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:04:13,944 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:13,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 08:04:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 08:04:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:04:13,957 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-10 08:04:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:13,967 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-10 08:04:13,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:04:13,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 08:04:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:13,974 INFO L225 Difference]: With dead ends: 44 [2018-11-10 08:04:13,974 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 08:04:13,975 INFO L605 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-10 08:04:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 08:04:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 08:04:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 08:04:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-10 08:04:13,998 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-11-10 08:04:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:13,998 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 08:04:13,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 08:04:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-10 08:04:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 08:04:13,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:13,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:13,999 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:13,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-11-10 08:04:13,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,038 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-10 08:04:14,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:04:14,039 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:04:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:04:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:04:14,040 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-11-10 08:04:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,074 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 08:04:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:04:14,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 08:04:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,077 INFO L225 Difference]: With dead ends: 61 [2018-11-10 08:04:14,077 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 08:04:14,077 INFO L605 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-10 08:04:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 08:04:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-11-10 08:04:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 08:04:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-10 08:04:14,085 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-11-10 08:04:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,085 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 08:04:14,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:04:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-10 08:04:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 08:04:14,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,086 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-11-10 08:04:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,122 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-10 08:04:14,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:04:14,122 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:04:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:04:14,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:04:14,123 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-11-10 08:04:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,167 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-10 08:04:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:04:14,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 08:04:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,171 INFO L225 Difference]: With dead ends: 56 [2018-11-10 08:04:14,171 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 08:04:14,172 INFO L605 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-10 08:04:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 08:04:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-10 08:04:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 08:04:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-10 08:04:14,176 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2018-11-10 08:04:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,176 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-10 08:04:14,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:04:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-10 08:04:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 08:04:14,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,177 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510122, now seen corresponding path program 1 times [2018-11-10 08:04:14,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,227 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-10 08:04:14,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:04:14,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:04:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:14,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:04:14,229 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2018-11-10 08:04:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,301 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-10 08:04:14,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:14,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 08:04:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,301 INFO L225 Difference]: With dead ends: 50 [2018-11-10 08:04:14,302 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 08:04:14,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:04:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 08:04:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-10 08:04:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 08:04:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-10 08:04:14,306 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2018-11-10 08:04:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,306 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-10 08:04:14,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:04:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-10 08:04:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:04:14,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,307 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash 646271685, now seen corresponding path program 1 times [2018-11-10 08:04:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,379 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-10 08:04:14,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:04:14,380 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:04:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:04:14,381 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-11-10 08:04:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,471 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-10 08:04:14,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:14,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 08:04:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,472 INFO L225 Difference]: With dead ends: 49 [2018-11-10 08:04:14,472 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 08:04:14,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:04:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 08:04:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-10 08:04:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 08:04:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-10 08:04:14,475 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-11-10 08:04:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,475 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-10 08:04:14,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:04:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-10 08:04:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:04:14,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,476 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1750858933, now seen corresponding path program 1 times [2018-11-10 08:04:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,570 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-10 08:04:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:04:14,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:04:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:04:14,571 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-11-10 08:04:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,661 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-10 08:04:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:04:14,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-10 08:04:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,663 INFO L225 Difference]: With dead ends: 68 [2018-11-10 08:04:14,663 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 08:04:14,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 08:04:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2018-11-10 08:04:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 08:04:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-10 08:04:14,668 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 17 [2018-11-10 08:04:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,668 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-10 08:04:14,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:04:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-10 08:04:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 08:04:14,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,669 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,670 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -361022790, now seen corresponding path program 1 times [2018-11-10 08:04:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:14,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 08:04:14,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 08:04:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:04:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:14,730 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-11-10 08:04:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,786 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-10 08:04:14,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:14,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-10 08:04:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,787 INFO L225 Difference]: With dead ends: 80 [2018-11-10 08:04:14,788 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 08:04:14,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:04:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 08:04:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2018-11-10 08:04:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 08:04:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-10 08:04:14,792 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 19 [2018-11-10 08:04:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,793 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-10 08:04:14,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 08:04:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-10 08:04:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 08:04:14,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,794 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,794 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1841873058, now seen corresponding path program 1 times [2018-11-10 08:04:14,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:04:14,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:04:14,835 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:04:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:04:14,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:04:14,835 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-11-10 08:04:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,879 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-11-10 08:04:14,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:04:14,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 08:04:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,880 INFO L225 Difference]: With dead ends: 59 [2018-11-10 08:04:14,880 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 08:04:14,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:04:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 08:04:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-10 08:04:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 08:04:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-10 08:04:14,884 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 23 [2018-11-10 08:04:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,884 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-10 08:04:14,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:04:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-10 08:04:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:04:14,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,885 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,885 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1263490023, now seen corresponding path program 1 times [2018-11-10 08:04:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:04:14,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:14,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:04:14,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:14,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:04:14,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:04:14,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:04:14,932 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2018-11-10 08:04:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:14,987 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-11-10 08:04:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:04:14,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-10 08:04:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:14,988 INFO L225 Difference]: With dead ends: 81 [2018-11-10 08:04:14,989 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 08:04:14,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:04:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 08:04:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2018-11-10 08:04:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 08:04:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-10 08:04:14,993 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 24 [2018-11-10 08:04:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:14,993 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-10 08:04:14,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:04:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-10 08:04:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 08:04:14,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:14,995 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:14,995 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:14,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash -662323091, now seen corresponding path program 1 times [2018-11-10 08:04:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:14,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:14,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:14,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:04:15,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:15,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:04:15,039 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:15,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:04:15,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:15,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:04:15,040 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-11-10 08:04:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:15,072 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-10 08:04:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:04:15,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-10 08:04:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:15,073 INFO L225 Difference]: With dead ends: 60 [2018-11-10 08:04:15,073 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 08:04:15,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 08:04:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-10 08:04:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 08:04:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-10 08:04:15,078 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2018-11-10 08:04:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:15,078 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 08:04:15,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:04:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-10 08:04:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 08:04:15,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:15,079 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:15,079 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:15,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 942820751, now seen corresponding path program 1 times [2018-11-10 08:04:15,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:15,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:15,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:15,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:15,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:04:15,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:15,107 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:15,108 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-10 08:04:15,110 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [61], [77], [78], [79], [81], [82] [2018-11-10 08:04:15,151 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:04:15,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:04:17,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:04:17,765 INFO L272 AbstractInterpreter]: Visited 30 different actions 910 times. Merged at 16 different actions 687 times. Widened at 2 different actions 26 times. Found 61 fixpoints after 5 different actions. Largest state had 30 variables. [2018-11-10 08:04:17,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:17,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:04:17,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:17,791 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:17,805 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:04:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:17,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:04:17,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:04:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:04:17,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:04:17,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-10 08:04:17,935 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:04:17,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:04:17,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:04:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:17,936 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2018-11-10 08:04:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:17,983 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-11-10 08:04:17,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:04:17,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-10 08:04:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:17,984 INFO L225 Difference]: With dead ends: 87 [2018-11-10 08:04:17,984 INFO L226 Difference]: Without dead ends: 87 [2018-11-10 08:04:17,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-10 08:04:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-11-10 08:04:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 08:04:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-11-10 08:04:17,988 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 32 [2018-11-10 08:04:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:17,988 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-10 08:04:17,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:04:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-11-10 08:04:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 08:04:17,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:17,989 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:17,992 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:17,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1231732939, now seen corresponding path program 1 times [2018-11-10 08:04:17,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:17,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:17,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:17,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:17,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:04:18,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:18,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:18,067 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-10 08:04:18,067 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [42], [43], [45], [77], [78], [79], [81], [82] [2018-11-10 08:04:18,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:04:18,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:04:20,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:04:20,952 INFO L272 AbstractInterpreter]: Visited 25 different actions 935 times. Merged at 17 different actions 729 times. Widened at 2 different actions 26 times. Found 61 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-10 08:04:20,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:20,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:04:20,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:20,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:20,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:20,964 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:04:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:20,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:04:21,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:04:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:04:21,148 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:04:21,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-11-10 08:04:21,148 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:21,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:04:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:21,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:04:21,149 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-11-10 08:04:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:21,285 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-10 08:04:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:21,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-10 08:04:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:21,286 INFO L225 Difference]: With dead ends: 79 [2018-11-10 08:04:21,286 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 08:04:21,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:04:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 08:04:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-11-10 08:04:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 08:04:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-11-10 08:04:21,298 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 37 [2018-11-10 08:04:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:21,298 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-11-10 08:04:21,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:04:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-11-10 08:04:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 08:04:21,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:21,299 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:21,301 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:21,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash -941785917, now seen corresponding path program 1 times [2018-11-10 08:04:21,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:21,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:04:21,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:21,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:21,362 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-10 08:04:21,363 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-11-10 08:04:21,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:04:21,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:04:23,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:04:23,380 INFO L272 AbstractInterpreter]: Visited 25 different actions 959 times. Merged at 16 different actions 687 times. Widened at 2 different actions 26 times. Found 61 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-10 08:04:23,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:23,383 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:04:23,531 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 74.86% of their original sizes. [2018-11-10 08:04:23,531 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:04:23,805 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-11-10 08:04:23,806 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:04:23,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:04:23,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [7] total 22 [2018-11-10 08:04:23,806 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:23,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 08:04:23,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 08:04:23,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:04:23,807 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2018-11-10 08:04:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:24,640 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-10 08:04:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:04:24,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-10 08:04:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:24,641 INFO L225 Difference]: With dead ends: 71 [2018-11-10 08:04:24,641 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 08:04:24,642 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:04:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 08:04:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-10 08:04:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 08:04:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-11-10 08:04:24,645 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 38 [2018-11-10 08:04:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:24,645 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-11-10 08:04:24,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 08:04:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-11-10 08:04:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 08:04:24,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:24,647 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:24,648 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:24,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:24,648 INFO L82 PathProgramCache]: Analyzing trace with hash 711061374, now seen corresponding path program 2 times [2018-11-10 08:04:24,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:24,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:24,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:24,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:24,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:04:24,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:24,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:24,714 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:04:24,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:04:24,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:24,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:24,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:04:24,723 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:04:24,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 08:04:24,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:24,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:04:24,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:04:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:04:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:04:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-10 08:04:24,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:04:24,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:04:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:04:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:04:24,854 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 10 states. [2018-11-10 08:04:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:24,935 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-10 08:04:24,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:04:24,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-10 08:04:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:24,936 INFO L225 Difference]: With dead ends: 84 [2018-11-10 08:04:24,936 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 08:04:24,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:04:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 08:04:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-11-10 08:04:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 08:04:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-11-10 08:04:24,939 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 43 [2018-11-10 08:04:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:24,940 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-11-10 08:04:24,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:04:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-11-10 08:04:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 08:04:24,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:24,941 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:24,941 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:24,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -208567033, now seen corresponding path program 3 times [2018-11-10 08:04:24,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:24,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:24,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 08:04:25,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:25,030 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:25,031 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:04:25,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:04:25,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:25,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:25,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:04:25,040 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:04:25,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:04:25,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:25,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:25,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 08:04:25,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 08:04:25,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 08:04:25,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,159 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2018-11-10 08:04:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 08:04:25,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:04:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 08:04:25,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:04:25,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 22 [2018-11-10 08:04:25,495 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:04:25,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 08:04:25,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 08:04:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-11-10 08:04:25,496 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 17 states. [2018-11-10 08:04:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:25,856 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-11-10 08:04:25,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 08:04:25,856 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-11-10 08:04:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:25,857 INFO L225 Difference]: With dead ends: 83 [2018-11-10 08:04:25,857 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 08:04:25,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 08:04:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 08:04:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-11-10 08:04:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 08:04:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-11-10 08:04:25,860 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 49 [2018-11-10 08:04:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:25,861 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-10 08:04:25,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 08:04:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-11-10 08:04:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 08:04:25,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:25,862 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:25,862 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:25,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1061039729, now seen corresponding path program 2 times [2018-11-10 08:04:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:25,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:25,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-10 08:04:25,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:25,912 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:25,912 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:04:25,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:04:25,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:25,912 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:25,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:04:25,928 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:04:25,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 08:04:25,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:25,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:25,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 08:04:25,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 08:04:25,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 08:04:25,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:25,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-10 08:04:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-10 08:04:26,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:04:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-10 08:04:26,170 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:04:26,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 13 [2018-11-10 08:04:26,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:26,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:04:26,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:04:26,171 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-11-10 08:04:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:26,202 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-10 08:04:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:26,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-10 08:04:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:26,203 INFO L225 Difference]: With dead ends: 78 [2018-11-10 08:04:26,204 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 08:04:26,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 153 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:04:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 08:04:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-10 08:04:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 08:04:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-10 08:04:26,206 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 82 [2018-11-10 08:04:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:26,206 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-10 08:04:26,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:04:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-10 08:04:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 08:04:26,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:26,208 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:26,208 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:26,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1524826330, now seen corresponding path program 1 times [2018-11-10 08:04:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-10 08:04:26,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:26,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:26,256 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-11-10 08:04:26,256 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [62], [65], [67], [76], [77], [78], [79], [81], [82] [2018-11-10 08:04:26,258 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:04:26,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:04:27,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:04:27,992 INFO L272 AbstractInterpreter]: Visited 33 different actions 913 times. Merged at 16 different actions 687 times. Widened at 2 different actions 26 times. Found 61 fixpoints after 5 different actions. Largest state had 36 variables. [2018-11-10 08:04:28,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:04:28,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:28,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:28,027 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:04:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 87 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 08:04:28,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:04:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 87 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 08:04:28,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:04:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2018-11-10 08:04:28,212 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:04:28,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 08:04:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 08:04:28,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-10 08:04:28,212 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2018-11-10 08:04:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:28,358 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2018-11-10 08:04:28,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:04:28,359 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-11-10 08:04:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:28,360 INFO L225 Difference]: With dead ends: 159 [2018-11-10 08:04:28,360 INFO L226 Difference]: Without dead ends: 159 [2018-11-10 08:04:28,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-11-10 08:04:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-10 08:04:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2018-11-10 08:04:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-10 08:04:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2018-11-10 08:04:28,364 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 85 [2018-11-10 08:04:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:28,364 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-11-10 08:04:28,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 08:04:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2018-11-10 08:04:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 08:04:28,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:04:28,366 INFO L375 BasicCegarLoop]: trace histogram [13, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,366 INFO L424 AbstractCegarLoop]: === Iteration 18 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:04:28,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1458424026, now seen corresponding path program 2 times [2018-11-10 08:04:28,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:04:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:04:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-10 08:04:28,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:04:28,477 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:04:28,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:04:28,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:28,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:04:28,487 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:04:28,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 08:04:28,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:28,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:28,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 08:04:28,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 08:04:28,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 08:04:28,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 08:04:28,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 08:04:28,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 08:04:28,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 08:04:28,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 08:04:28,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 08:04:28,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 08:04:28,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 08:04:28,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 08:04:28,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 08:04:28,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 08:04:28,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 08:04:28,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 08:04:28,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 08:04:28,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 08:04:28,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:04:28,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 08:04:28,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 08:04:28,766 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int) (|v_main_~#b~0.base_15| Int)) (let ((.cse0 (store |c_old(#valid)| |v_main_~#b~0.base_15| 1))) (and (= (select .cse0 main_ULTIMATE.dealloc_~addr.base) 0) (= |c_#valid| (store (store (store .cse0 main_ULTIMATE.dealloc_~addr.base 1) |v_main_~#b~0.base_15| 0) main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select |c_old(#valid)| |v_main_~#b~0.base_15|))))) is different from true [2018-11-10 08:04:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-11-10 08:04:28,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:04:28,841 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_~#b~0.base_17| Int) (|v_main_~#mask~0.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_~#b~0.base_17| 1))) (or (= (store (store (store .cse0 |v_main_~#mask~0.base_19| 1) |v_main_~#b~0.base_17| 0) |v_main_~#mask~0.base_19| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_~#b~0.base_17|))) (not (= (select .cse0 |v_main_~#mask~0.base_19|) 0))))) is different from false [2018-11-10 08:04:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-11-10 08:04:28,871 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:04:28,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 13 [2018-11-10 08:04:28,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:04:28,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:04:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:28,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=81, Unknown=2, NotChecked=38, Total=156 [2018-11-10 08:04:28,872 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 6 states. [2018-11-10 08:04:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:28,932 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-11-10 08:04:28,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:28,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-11-10 08:04:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:04:28,933 INFO L225 Difference]: With dead ends: 121 [2018-11-10 08:04:28,933 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 08:04:28,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 232 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2018-11-10 08:04:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 08:04:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 08:04:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 08:04:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:04:28,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2018-11-10 08:04:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:04:28,934 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:04:28,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:04:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:04:28,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 08:04:28,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:04:28 BoogieIcfgContainer [2018-11-10 08:04:28,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:04:28,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:04:28,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:04:28,938 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:04:28,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:04:13" (3/4) ... [2018-11-10 08:04:28,942 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 08:04:28,947 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 08:04:28,947 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-10 08:04:28,948 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 08:04:28,952 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2018-11-10 08:04:28,952 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-10 08:04:28,952 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 08:04:28,985 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b42616da-4f04-4490-9967-67af208997c3/bin-2019/utaipan/witness.graphml [2018-11-10 08:04:28,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:04:28,986 INFO L168 Benchmark]: Toolchain (without parser) took 15621.80 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 959.3 MB in the beginning and 1.5 GB in the end (delta: -507.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 08:04:28,987 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:04:28,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 947.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-10 08:04:28,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.99 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:04:28,987 INFO L168 Benchmark]: Boogie Preprocessor took 18.49 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:04:28,988 INFO L168 Benchmark]: RCFGBuilder took 234.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:04:28,988 INFO L168 Benchmark]: TraceAbstraction took 15144.19 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -344.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 08:04:28,988 INFO L168 Benchmark]: Witness Printer took 46.86 ms. Allocated memory is still 2.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:04:28,991 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 947.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.99 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.49 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 234.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15144.19 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -344.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 46.86 ms. Allocated memory is still 2.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 8 error locations. SAFE Result, 15.1s OverallTime, 18 OverallIterations, 13 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 592 SDtfs, 791 SDslu, 1445 SDs, 0 SdLazy, 1358 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1055 GetRequests, 866 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.3s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9446246246246248 AbsIntWeakeningRatio, 1.3513513513513513 AbsIntAvgWeakeningVarsNumRemoved, 159.8918918918919 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 936 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1535 ConstructedInterpolants, 186 QuantifiedInterpolants, 605235 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1100 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 2024/2229 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...