./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_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_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/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 07b05923cf5c1b39a35ab81b524575a0a488c268 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:46:34,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:46:34,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:46:34,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:46:34,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:46:34,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:46:34,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:46:34,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:46:34,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:46:34,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:46:34,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:46:34,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:46:34,142 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:46:34,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:46:34,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:46:34,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:46:34,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:46:34,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:46:34,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:46:34,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:46:34,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:46:34,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:46:34,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:46:34,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:46:34,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:46:34,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:46:34,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:46:34,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:46:34,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:46:34,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:46:34,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:46:34,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:46:34,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:46:34,162 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:46:34,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:46:34,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:46:34,164 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-10-27 04:46:34,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:46:34,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:46:34,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:46:34,179 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:46:34,180 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:46:34,180 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:46:34,181 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:46:34,181 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:46:34,181 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:46:34,181 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:46:34,181 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:46:34,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:46:34,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:46:34,183 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:46:34,183 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:46:34,183 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:46:34,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:46:34,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:46:34,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:46:34,184 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:46:34,184 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:46:34,184 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:46:34,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:46:34,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:46:34,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:46:34,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:46:34,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:46:34,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:46:34,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:46:34,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:46:34,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:46:34,188 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:46:34,188 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:46:34,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:46:34,188 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_9d53756b-dccd-46a5-b763-44c94e6fee84/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 -> 07b05923cf5c1b39a35ab81b524575a0a488c268 [2018-10-27 04:46:34,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:46:34,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:46:34,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:46:34,249 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:46:34,250 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:46:34,250 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-10-27 04:46:34,311 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/data/398e0f875/7e59fe3392844818b0dfc3e6f40090c9/FLAG237566528 [2018-10-27 04:46:34,690 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:46:34,691 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-10-27 04:46:34,697 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/data/398e0f875/7e59fe3392844818b0dfc3e6f40090c9/FLAG237566528 [2018-10-27 04:46:34,710 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/data/398e0f875/7e59fe3392844818b0dfc3e6f40090c9 [2018-10-27 04:46:34,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:46:34,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:46:34,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:34,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:46:34,719 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:46:34,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fda8585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34, skipping insertion in model container [2018-10-27 04:46:34,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:46:34,750 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:46:34,885 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:34,894 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:46:34,910 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:34,926 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:46:34,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34 WrapperNode [2018-10-27 04:46:34,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:34,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:34,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:46:34,928 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:46:34,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:34,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:46:34,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:46:34,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:46:34,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:34,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:35,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:35,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... [2018-10-27 04:46:35,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:46:35,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:46:35,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:46:35,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:46:35,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/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-10-27 04:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:46:35,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:46:35,139 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-10-27 04:46:35,139 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-10-27 04:46:35,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:46:35,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:46:35,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:46:35,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:46:35,593 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:46:35,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:35 BoogieIcfgContainer [2018-10-27 04:46:35,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:46:35,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:46:35,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:46:35,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:46:35,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:46:34" (1/3) ... [2018-10-27 04:46:35,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c947e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:35, skipping insertion in model container [2018-10-27 04:46:35,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:34" (2/3) ... [2018-10-27 04:46:35,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c947e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:35, skipping insertion in model container [2018-10-27 04:46:35,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:35" (3/3) ... [2018-10-27 04:46:35,602 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-10-27 04:46:35,611 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:46:35,618 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-27 04:46:35,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-27 04:46:35,655 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:46:35,655 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:46:35,656 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:46:35,656 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:46:35,656 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:46:35,656 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:46:35,657 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:46:35,657 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:46:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-10-27 04:46:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 04:46:35,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:35,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:35,683 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:35,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-10-27 04:46:35,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:35,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:35,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:35,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:35,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:46:35,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:35,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:46:35,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:46:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:46:35,853 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-10-27 04:46:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:35,878 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-10-27 04:46:35,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:46:35,879 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-27 04:46:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:35,888 INFO L225 Difference]: With dead ends: 44 [2018-10-27 04:46:35,888 INFO L226 Difference]: Without dead ends: 41 [2018-10-27 04:46:35,890 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-10-27 04:46:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-27 04:46:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-27 04:46:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 04:46:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-27 04:46:35,929 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-10-27 04:46:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:35,930 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-27 04:46:35,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:46:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-27 04:46:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 04:46:35,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:35,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:35,930 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:35,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:35,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-10-27 04:46:35,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:35,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:35,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:36,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:36,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:36,019 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:36,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:36,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:36,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:36,021 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-10-27 04:46:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:36,133 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-10-27 04:46:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:36,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-27 04:46:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:36,137 INFO L225 Difference]: With dead ends: 61 [2018-10-27 04:46:36,137 INFO L226 Difference]: Without dead ends: 61 [2018-10-27 04:46:36,138 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-10-27 04:46:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-27 04:46:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-10-27 04:46:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-27 04:46:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-10-27 04:46:36,148 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-10-27 04:46:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:36,149 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-10-27 04:46:36,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-10-27 04:46:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 04:46:36,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:36,150 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:36,150 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:36,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-10-27 04:46:36,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:36,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:36,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:36,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:36,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:46:36,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:36,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:36,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:36,228 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-10-27 04:46:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:36,307 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-10-27 04:46:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:36,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-27 04:46:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:36,310 INFO L225 Difference]: With dead ends: 56 [2018-10-27 04:46:36,311 INFO L226 Difference]: Without dead ends: 56 [2018-10-27 04:46:36,311 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-10-27 04:46:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-27 04:46:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-10-27 04:46:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 04:46:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-10-27 04:46:36,315 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2018-10-27 04:46:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:36,315 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-10-27 04:46:36,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-10-27 04:46:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:46:36,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:36,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:36,317 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:36,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510122, now seen corresponding path program 1 times [2018-10-27 04:46:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:36,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:36,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:36,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:36,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:36,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:46:36,471 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:36,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:46:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:46:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:36,472 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 7 states. [2018-10-27 04:46:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:36,776 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-10-27 04:46:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:36,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-10-27 04:46:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:36,777 INFO L225 Difference]: With dead ends: 50 [2018-10-27 04:46:36,777 INFO L226 Difference]: Without dead ends: 50 [2018-10-27 04:46:36,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-27 04:46:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-27 04:46:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 04:46:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-10-27 04:46:36,780 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2018-10-27 04:46:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:36,780 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-10-27 04:46:36,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:46:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-10-27 04:46:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:46:36,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:36,781 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:36,782 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:36,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash 646271685, now seen corresponding path program 1 times [2018-10-27 04:46:36,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:36,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:36,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:36,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:36,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:37,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:37,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:46:37,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:37,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:46:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:46:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:37,011 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2018-10-27 04:46:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:37,577 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-10-27 04:46:37,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:46:37,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-10-27 04:46:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:37,578 INFO L225 Difference]: With dead ends: 49 [2018-10-27 04:46:37,578 INFO L226 Difference]: Without dead ends: 49 [2018-10-27 04:46:37,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-27 04:46:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-27 04:46:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 04:46:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-10-27 04:46:37,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-10-27 04:46:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:37,583 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-27 04:46:37,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:46:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-10-27 04:46:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:46:37,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:37,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:37,584 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:37,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1750858933, now seen corresponding path program 1 times [2018-10-27 04:46:37,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:37,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:37,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:37,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:37,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:37,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:37,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:37,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:37,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:37,698 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2018-10-27 04:46:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:37,760 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-10-27 04:46:37,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:37,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-27 04:46:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:37,763 INFO L225 Difference]: With dead ends: 52 [2018-10-27 04:46:37,763 INFO L226 Difference]: Without dead ends: 49 [2018-10-27 04:46:37,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-27 04:46:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-27 04:46:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 04:46:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-10-27 04:46:37,766 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 17 [2018-10-27 04:46:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:37,766 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-10-27 04:46:37,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-10-27 04:46:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:46:37,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:37,767 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:37,767 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:37,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash -361022790, now seen corresponding path program 1 times [2018-10-27 04:46:37,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:37,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:37,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:37,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:37,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:37,849 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-27 04:46:37,850 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [15], [17], [19], [28], [32], [37], [77], [78], [79], [81] [2018-10-27 04:46:37,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:37,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:38,454 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:46:38,455 INFO L272 AbstractInterpreter]: Visited 17 different actions 68 times. Merged at 6 different actions 44 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 04:46:38,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:38,492 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:46:38,597 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 80.7% of their original sizes. [2018-10-27 04:46:38,597 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:46:39,449 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-10-27 04:46:39,449 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:46:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2018-10-27 04:46:39,450 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:39,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:46:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:46:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:39,451 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-10-27 04:46:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:40,447 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-10-27 04:46:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:46:40,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-27 04:46:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:40,449 INFO L225 Difference]: With dead ends: 83 [2018-10-27 04:46:40,449 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 04:46:40,449 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:46:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 04:46:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2018-10-27 04:46:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 04:46:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-10-27 04:46:40,457 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 19 [2018-10-27 04:46:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:40,457 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-10-27 04:46:40,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:46:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-10-27 04:46:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 04:46:40,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:40,458 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-10-27 04:46:40,460 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:40,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1841873058, now seen corresponding path program 1 times [2018-10-27 04:46:40,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:40,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:40,462 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:40,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:40,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:40,627 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-27 04:46:40,627 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [40], [77], [78], [79], [81], [82] [2018-10-27 04:46:40,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:40,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:40,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:40,913 INFO L272 AbstractInterpreter]: Visited 22 different actions 95 times. Merged at 6 different actions 62 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-10-27 04:46:40,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:40,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:40,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:40,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/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-10-27 04:46:40,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:40,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:46:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:40,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:41,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:41,597 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:46:41,733 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:46:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:41,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:41,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-27 04:46:41,971 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:41,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:46:41,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:46:41,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:41,972 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 8 states. [2018-10-27 04:46:42,433 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-27 04:46:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:42,627 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-10-27 04:46:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:42,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-10-27 04:46:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:42,628 INFO L225 Difference]: With dead ends: 85 [2018-10-27 04:46:42,628 INFO L226 Difference]: Without dead ends: 79 [2018-10-27 04:46:42,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:46:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-27 04:46:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-10-27 04:46:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 04:46:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-10-27 04:46:42,634 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 23 [2018-10-27 04:46:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:42,635 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-10-27 04:46:42,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:46:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-10-27 04:46:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:46:42,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:42,635 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:42,635 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:42,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash 216654009, now seen corresponding path program 2 times [2018-10-27 04:46:42,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:42,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:42,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:42,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:42,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:42,798 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:46:42,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:46:42,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:42,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:46:42,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:46:42,815 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:42,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:46:42,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:42,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:42,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-10-27 04:46:42,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:46:42,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:42,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:42,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:42,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-10-27 04:46:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:46:42,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:46:43,024 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:43,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [6] total 9 [2018-10-27 04:46:43,025 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:43,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:43,026 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2018-10-27 04:46:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:43,097 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-10-27 04:46:43,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:43,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-10-27 04:46:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:43,098 INFO L225 Difference]: With dead ends: 70 [2018-10-27 04:46:43,098 INFO L226 Difference]: Without dead ends: 70 [2018-10-27 04:46:43,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-27 04:46:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-27 04:46:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 04:46:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-10-27 04:46:43,107 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 29 [2018-10-27 04:46:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:43,107 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-10-27 04:46:43,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-10-27 04:46:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 04:46:43,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:43,110 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:43,110 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:43,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1873660240, now seen corresponding path program 1 times [2018-10-27 04:46:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:43,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:43,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:43,247 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-27 04:46:43,247 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [42], [77], [78], [79], [81], [82] [2018-10-27 04:46:43,248 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:43,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:43,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:43,453 INFO L272 AbstractInterpreter]: Visited 23 different actions 96 times. Merged at 6 different actions 62 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-10-27 04:46:43,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:43,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:43,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:43,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/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-10-27 04:46:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:43,464 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:46:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:43,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:43,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:43,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:43,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-10-27 04:46:43,694 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:43,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:46:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:46:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:46:43,695 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 10 states. [2018-10-27 04:46:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:43,880 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-10-27 04:46:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:43,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-10-27 04:46:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:43,881 INFO L225 Difference]: With dead ends: 96 [2018-10-27 04:46:43,882 INFO L226 Difference]: Without dead ends: 90 [2018-10-27 04:46:43,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:46:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-27 04:46:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-10-27 04:46:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-27 04:46:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-10-27 04:46:43,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 30 [2018-10-27 04:46:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:43,888 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-10-27 04:46:43,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:46:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-10-27 04:46:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 04:46:43,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:43,889 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:43,890 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:43,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:43,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1424498361, now seen corresponding path program 2 times [2018-10-27 04:46:43,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,891 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:44,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:44,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:44,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:46:44,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:46:44,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:44,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/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-10-27 04:46:44,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:46:44,107 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:46:44,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:46:44,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:44,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:44,266 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 04:46:44,268 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-10-27 04:46:44,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:44,277 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-10-27 04:46:44,285 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-10-27 04:46:44,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:44,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:44,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:44,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-10-27 04:46:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:46:44,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:46:44,468 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:44,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 14 [2018-10-27 04:46:44,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:44,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:44,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:46:44,469 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states. [2018-10-27 04:46:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:44,632 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-10-27 04:46:44,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:44,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-10-27 04:46:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:44,637 INFO L225 Difference]: With dead ends: 81 [2018-10-27 04:46:44,637 INFO L226 Difference]: Without dead ends: 81 [2018-10-27 04:46:44,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:46:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-27 04:46:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-10-27 04:46:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-27 04:46:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-10-27 04:46:44,644 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 36 [2018-10-27 04:46:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:44,645 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-10-27 04:46:44,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-10-27 04:46:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:46:44,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:44,646 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:44,646 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:44,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 940344667, now seen corresponding path program 1 times [2018-10-27 04:46:44,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:46:44,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:44,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:44,759 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:44,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:44,760 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 6 states. [2018-10-27 04:46:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:44,816 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-10-27 04:46:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:44,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-10-27 04:46:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:44,817 INFO L225 Difference]: With dead ends: 80 [2018-10-27 04:46:44,817 INFO L226 Difference]: Without dead ends: 80 [2018-10-27 04:46:44,817 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-10-27 04:46:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-27 04:46:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-10-27 04:46:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 04:46:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-10-27 04:46:44,826 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 43 [2018-10-27 04:46:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:44,826 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-10-27 04:46:44,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-10-27 04:46:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 04:46:44,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:44,827 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:44,827 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:44,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash -914086303, now seen corresponding path program 1 times [2018-10-27 04:46:44,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:44,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:44,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:44,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:46:44,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:44,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:44,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-27 04:46:44,881 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-10-27 04:46:44,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:44,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:47,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:47,632 INFO L272 AbstractInterpreter]: Visited 30 different actions 1026 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 33 variables. [2018-10-27 04:46:47,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:47,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:47,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:47,681 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:46:47,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:47,696 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:47,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:48,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:48,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:48,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2018-10-27 04:46:48,505 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:48,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:46:48,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:46:48,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:46:48,506 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 9 states. [2018-10-27 04:46:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:48,603 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-10-27 04:46:48,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:46:48,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-10-27 04:46:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:48,605 INFO L225 Difference]: With dead ends: 135 [2018-10-27 04:46:48,605 INFO L226 Difference]: Without dead ends: 129 [2018-10-27 04:46:48,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:46:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-27 04:46:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2018-10-27 04:46:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 04:46:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-10-27 04:46:48,610 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 44 [2018-10-27 04:46:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:48,610 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-10-27 04:46:48,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:46:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-10-27 04:46:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 04:46:48,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:48,611 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:48,611 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:48,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1220773474, now seen corresponding path program 1 times [2018-10-27 04:46:48,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:48,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:48,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:48,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:49,004 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-27 04:46:49,160 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-27 04:46:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 44 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:46:49,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:49,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:49,329 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-27 04:46:49,329 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-10-27 04:46:49,330 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:49,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:52,132 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:46:52,132 INFO L272 AbstractInterpreter]: Visited 25 different actions 1130 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 30 variables. [2018-10-27 04:46:52,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:52,172 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:46:52,339 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 70.48% of their original sizes. [2018-10-27 04:46:52,340 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:46:54,351 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-10-27 04:46:54,351 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:46:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:54,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [8] total 25 [2018-10-27 04:46:54,352 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:54,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 04:46:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 04:46:54,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:46:54,352 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 19 states. [2018-10-27 04:46:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:56,961 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-10-27 04:46:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:46:56,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-10-27 04:46:56,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:56,962 INFO L225 Difference]: With dead ends: 102 [2018-10-27 04:46:56,962 INFO L226 Difference]: Without dead ends: 102 [2018-10-27 04:46:56,963 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-10-27 04:46:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-27 04:46:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-10-27 04:46:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-27 04:46:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-10-27 04:46:56,966 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 56 [2018-10-27 04:46:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:56,967 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-10-27 04:46:56,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 04:46:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-10-27 04:46:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 04:46:56,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:56,972 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:56,972 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:56,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1005236038, now seen corresponding path program 2 times [2018-10-27 04:46:56,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:56,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:56,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-10-27 04:46:57,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:57,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:57,137 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:46:57,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:46:57,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:57,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/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-10-27 04:46:57,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:46:57,146 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:46:57,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:46:57,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:57,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:57,177 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-10-27 04:46:57,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,183 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-10-27 04:46:57,192 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-10-27 04:46:57,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-10-27 04:46:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-10-27 04:46:57,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-10-27 04:46:57,617 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:57,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 12 [2018-10-27 04:46:57,617 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:57,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:57,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:46:57,618 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 6 states. [2018-10-27 04:46:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:57,665 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-10-27 04:46:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:57,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-10-27 04:46:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:57,667 INFO L225 Difference]: With dead ends: 101 [2018-10-27 04:46:57,667 INFO L226 Difference]: Without dead ends: 101 [2018-10-27 04:46:57,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:46:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-27 04:46:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-27 04:46:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-27 04:46:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-10-27 04:46:57,670 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 87 [2018-10-27 04:46:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:57,670 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-10-27 04:46:57,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-10-27 04:46:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 04:46:57,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:57,672 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:57,672 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:46:57,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1820052541, now seen corresponding path program 1 times [2018-10-27 04:46:57,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:57,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:57,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:57,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:57,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-10-27 04:46:57,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:57,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:57,957 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-10-27 04:46:57,957 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-10-27 04:46:57,959 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:57,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:00,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:00,139 INFO L272 AbstractInterpreter]: Visited 33 different actions 1029 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 39 variables. [2018-10-27 04:47:00,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:00,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:00,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:00,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/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-10-27 04:47:00,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:00,248 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:00,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 123 proven. 44 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-27 04:47:01,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 5 proven. 161 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-27 04:47:01,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:01,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2018-10-27 04:47:01,221 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:01,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:01,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:01,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:01,222 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 11 states. [2018-10-27 04:47:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:01,404 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-10-27 04:47:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:01,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-27 04:47:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:01,406 INFO L225 Difference]: With dead ends: 158 [2018-10-27 04:47:01,406 INFO L226 Difference]: Without dead ends: 152 [2018-10-27 04:47:01,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-27 04:47:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2018-10-27 04:47:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-27 04:47:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-10-27 04:47:01,411 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 90 [2018-10-27 04:47:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:01,411 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-10-27 04:47:01,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-10-27 04:47:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-27 04:47:01,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:01,417 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 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-10-27 04:47:01,417 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-10-27 04:47:01,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1515618710, now seen corresponding path program 2 times [2018-10-27 04:47:01,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:01,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:01,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:01,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2018-10-27 04:47:01,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:01,526 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:01,526 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:01,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:01,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:01,526 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:01,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:01,534 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:01,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:01,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:01,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:01,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:01,582 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-10-27 04:47:01,583 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-10-27 04:47:01,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,603 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-10-27 04:47:01,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:01,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:01,684 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-10-27 04:47:01,685 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-10-27 04:47:01,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,693 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-10-27 04:47:01,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:01,742 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:01,743 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-10-27 04:47:01,745 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-10-27 04:47:01,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,751 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-10-27 04:47:01,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:01,794 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int) (|v_main_~#b~0.base_12| Int)) (let ((.cse0 (store |c_old(#valid)| |v_main_~#b~0.base_12| 1))) (and (= |c_#valid| (store (store (store .cse0 main_ULTIMATE.dealloc_~addr.base 1) |v_main_~#b~0.base_12| 0) main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select .cse0 main_ULTIMATE.dealloc_~addr.base)) (= 0 (select |c_old(#valid)| |v_main_~#b~0.base_12|))))) is different from true [2018-10-27 04:47:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-10-27 04:47:01,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:01,906 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#Ultimate.alloc_#res.base_6| Int) (|v_main_~#b~0.base_14| Int)) (let ((.cse0 (store |c_#valid| |v_main_~#b~0.base_14| 1))) (or (not (= (select .cse0 |v_main_#Ultimate.alloc_#res.base_6|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#Ultimate.alloc_#res.base_6| 1) |v_main_~#b~0.base_14| 0) |v_main_#Ultimate.alloc_#res.base_6| 0)) (not (= 0 (select |c_#valid| |v_main_~#b~0.base_14|)))))) is different from false [2018-10-27 04:47:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-10-27 04:47:01,935 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:01,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 12 [2018-10-27 04:47:01,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:01,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:01,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:01,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=67, Unknown=2, NotChecked=34, Total=132 [2018-10-27 04:47:01,936 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 6 states. [2018-10-27 04:47:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:02,018 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-10-27 04:47:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:02,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-27 04:47:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:02,019 INFO L225 Difference]: With dead ends: 126 [2018-10-27 04:47:02,019 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 04:47:02,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 280 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=102, Unknown=2, NotChecked=42, Total=182 [2018-10-27 04:47:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 04:47:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 04:47:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 04:47:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 04:47:02,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-10-27 04:47:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:02,020 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 04:47:02,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 04:47:02,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 04:47:02,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:47:02 BoogieIcfgContainer [2018-10-27 04:47:02,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:47:02,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:47:02,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:47:02,028 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:47:02,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:35" (3/4) ... [2018-10-27 04:47:02,032 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 04:47:02,040 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 04:47:02,040 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-10-27 04:47:02,040 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 04:47:02,043 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2018-10-27 04:47:02,043 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-10-27 04:47:02,043 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-10-27 04:47:02,082 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9d53756b-dccd-46a5-b763-44c94e6fee84/bin-2019/utaipan/witness.graphml [2018-10-27 04:47:02,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:47:02,083 INFO L168 Benchmark]: Toolchain (without parser) took 27369.71 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 959.7 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 412.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:02,084 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:02,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.61 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:02,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:02,085 INFO L168 Benchmark]: Boogie Preprocessor took 34.45 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:02,085 INFO L168 Benchmark]: RCFGBuilder took 589.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:02,085 INFO L168 Benchmark]: TraceAbstraction took 26430.03 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -974.2 MB). Peak memory consumption was 426.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:02,086 INFO L168 Benchmark]: Witness Printer took 54.61 ms. Allocated memory is still 2.6 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:02,087 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.61 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.45 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 589.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26430.03 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -974.2 MB). Peak memory consumption was 426.7 MB. Max. memory is 11.5 GB. * Witness Printer took 54.61 ms. Allocated memory is still 2.6 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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, 26.3s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 549 SDtfs, 700 SDslu, 1694 SDs, 0 SdLazy, 758 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1146 GetRequests, 960 SyntacticMatches, 14 SemanticMatches, 172 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.0s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.9403523922970023 AbsIntWeakeningRatio, 1.452054794520548 AbsIntAvgWeakeningVarsNumRemoved, 162.3835616438356 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 130 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1619 ConstructedInterpolants, 233 QuantifiedInterpolants, 727582 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1095 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 33 InterpolantComputations, 15 PerfectInterpolantSequences, 3514/3933 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...