./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/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 a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:59:18,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:59:18,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:59:18,220 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:59:18,220 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:59:18,221 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:59:18,222 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:59:18,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:59:18,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:59:18,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:59:18,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:59:18,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:59:18,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:59:18,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:59:18,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:59:18,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:59:18,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:59:18,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:59:18,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:59:18,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:59:18,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:59:18,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:59:18,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:59:18,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:59:18,235 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:59:18,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:59:18,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:59:18,236 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:59:18,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:59:18,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:59:18,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:59:18,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:59:18,237 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:59:18,237 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:59:18,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:59:18,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:59:18,238 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 14:59:18,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:59:18,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:59:18,246 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 14:59:18,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 14:59:18,246 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 14:59:18,247 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 14:59:18,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:59:18,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:59:18,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:59:18,247 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:59:18,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:59:18,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:59:18,247 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:59:18,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 14:59:18,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:59:18,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:59:18,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:59:18,249 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 14:59:18,249 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:59:18,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 14:59:18,249 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_c5afd0ea-b117-40cf-8cde-09303938194b/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 -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2018-12-08 14:59:18,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:59:18,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:59:18,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:59:18,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:59:18,276 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:59:18,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-12-08 14:59:18,312 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/data/0c9265d1f/5be6a8aecc7f4b4081efd633e28fddbd/FLAGaf7d48330 [2018-12-08 14:59:18,693 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:59:18,693 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-12-08 14:59:18,696 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/data/0c9265d1f/5be6a8aecc7f4b4081efd633e28fddbd/FLAGaf7d48330 [2018-12-08 14:59:18,704 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/data/0c9265d1f/5be6a8aecc7f4b4081efd633e28fddbd [2018-12-08 14:59:18,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:59:18,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:59:18,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:59:18,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:59:18,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:59:18,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd2551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18, skipping insertion in model container [2018-12-08 14:59:18,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:59:18,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:59:18,809 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:59:18,815 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:59:18,825 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:59:18,833 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:59:18,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18 WrapperNode [2018-12-08 14:59:18,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:59:18,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:59:18,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:59:18,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:59:18,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:59:18,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:59:18,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:59:18,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:59:18,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... [2018-12-08 14:59:18,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:59:18,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:59:18,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:59:18,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:59:18,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:59:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:59:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 14:59:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 14:59:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:59:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-12-08 14:59:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-12-08 14:59:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:59:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:59:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:59:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 14:59:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 14:59:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:59:19,055 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:59:19,055 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-08 14:59:19,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:59:19 BoogieIcfgContainer [2018-12-08 14:59:19,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:59:19,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 14:59:19,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 14:59:19,059 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 14:59:19,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 02:59:18" (1/3) ... [2018-12-08 14:59:19,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4645b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:59:19, skipping insertion in model container [2018-12-08 14:59:19,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:59:18" (2/3) ... [2018-12-08 14:59:19,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4645b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:59:19, skipping insertion in model container [2018-12-08 14:59:19,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:59:19" (3/3) ... [2018-12-08 14:59:19,062 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-12-08 14:59:19,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 14:59:19,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-12-08 14:59:19,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-12-08 14:59:19,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 14:59:19,103 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 14:59:19,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 14:59:19,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:59:19,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:59:19,103 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 14:59:19,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:59:19,103 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 14:59:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-08 14:59:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 14:59:19,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:19,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:19,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:19,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:19,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-12-08 14:59:19,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:59:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:59:19,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:19,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:59:19,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:59:19,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:59:19,222 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-08 14:59:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:19,265 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-12-08 14:59:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:59:19,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 14:59:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:19,271 INFO L225 Difference]: With dead ends: 58 [2018-12-08 14:59:19,271 INFO L226 Difference]: Without dead ends: 54 [2018-12-08 14:59:19,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:59:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-08 14:59:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-12-08 14:59:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 14:59:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-08 14:59:19,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-12-08 14:59:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:19,297 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-08 14:59:19,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:59:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-08 14:59:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 14:59:19,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:19,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:19,298 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:19,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-12-08 14:59:19,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:19,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:19,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:59:19,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:59:19,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:19,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:59:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:59:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:59:19,341 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-12-08 14:59:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:19,394 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-12-08 14:59:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:59:19,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-08 14:59:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:19,395 INFO L225 Difference]: With dead ends: 59 [2018-12-08 14:59:19,395 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 14:59:19,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:59:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 14:59:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-12-08 14:59:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 14:59:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-12-08 14:59:19,398 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-12-08 14:59:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:19,399 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-12-08 14:59:19,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:59:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-12-08 14:59:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 14:59:19,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:19,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:19,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:19,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-12-08 14:59:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:19,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:19,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:19,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:59:19,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:59:19,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:19,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:59:19,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:59:19,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:59:19,418 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-12-08 14:59:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:19,433 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-08 14:59:19,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:59:19,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 14:59:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:19,434 INFO L225 Difference]: With dead ends: 43 [2018-12-08 14:59:19,434 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 14:59:19,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:59:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 14:59:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-08 14:59:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 14:59:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-08 14:59:19,437 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2018-12-08 14:59:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:19,437 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-08 14:59:19,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:59:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-08 14:59:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 14:59:19,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:19,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:19,438 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:19,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2018-12-08 14:59:19,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:19,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:19,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:19,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:59:19,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:59:19,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:19,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:59:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:59:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:59:19,463 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2018-12-08 14:59:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:19,483 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-12-08 14:59:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:59:19,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 14:59:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:19,484 INFO L225 Difference]: With dead ends: 47 [2018-12-08 14:59:19,484 INFO L226 Difference]: Without dead ends: 47 [2018-12-08 14:59:19,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:59:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-08 14:59:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-08 14:59:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 14:59:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-12-08 14:59:19,487 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-12-08 14:59:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:19,487 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-12-08 14:59:19,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:59:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-12-08 14:59:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 14:59:19,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:19,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:19,488 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:19,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2018-12-08 14:59:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:19,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:19,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:19,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:19,508 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-08 14:59:19,509 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [22], [23], [27], [33], [35], [37], [38], [41], [43], [47], [55], [58], [73], [74], [75], [77], [78] [2018-12-08 14:59:19,529 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:59:19,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:59:19,630 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 14:59:19,631 INFO L272 AbstractInterpreter]: Visited 18 different actions 26 times. Merged at 2 different actions 2 times. Never widened. Performed 159 root evaluator evaluations with a maximum evaluation depth of 4. Performed 159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-08 14:59:19,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:19,638 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 14:59:19,680 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 55.36% of their original sizes. [2018-12-08 14:59:19,680 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 14:59:19,743 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-08 14:59:19,743 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 14:59:19,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:59:19,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-12-08 14:59:19,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:19,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 14:59:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 14:59:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-08 14:59:19,744 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 12 states. [2018-12-08 14:59:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:20,360 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-08 14:59:20,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 14:59:20,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-12-08 14:59:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:20,361 INFO L225 Difference]: With dead ends: 80 [2018-12-08 14:59:20,362 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 14:59:20,362 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-08 14:59:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 14:59:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2018-12-08 14:59:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-08 14:59:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-12-08 14:59:20,368 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 21 [2018-12-08 14:59:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:20,369 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-12-08 14:59:20,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 14:59:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-12-08 14:59:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 14:59:20,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:20,370 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:20,370 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:20,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:20,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2018-12-08 14:59:20,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 14:59:20,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:59:20,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 14:59:20,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:20,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:59:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:59:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:59:20,406 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 5 states. [2018-12-08 14:59:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:20,445 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-12-08 14:59:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:59:20,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-08 14:59:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:20,447 INFO L225 Difference]: With dead ends: 78 [2018-12-08 14:59:20,447 INFO L226 Difference]: Without dead ends: 78 [2018-12-08 14:59:20,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:59:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-08 14:59:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-12-08 14:59:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-08 14:59:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2018-12-08 14:59:20,452 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 22 [2018-12-08 14:59:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:20,452 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2018-12-08 14:59:20,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:59:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2018-12-08 14:59:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 14:59:20,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:20,453 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:20,453 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:20,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:20,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2018-12-08 14:59:20,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:20,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:20,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:20,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:59:20,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 14:59:20,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:20,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:59:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:59:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:59:20,481 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 5 states. [2018-12-08 14:59:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:20,508 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-12-08 14:59:20,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:59:20,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-08 14:59:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:20,508 INFO L225 Difference]: With dead ends: 66 [2018-12-08 14:59:20,508 INFO L226 Difference]: Without dead ends: 66 [2018-12-08 14:59:20,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:59:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-08 14:59:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-08 14:59:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 14:59:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-08 14:59:20,512 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 23 [2018-12-08 14:59:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:20,512 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-08 14:59:20,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:59:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-08 14:59:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 14:59:20,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:20,512 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:20,512 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:20,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:20,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2018-12-08 14:59:20,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:20,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:20,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:20,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:20,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:20,612 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-08 14:59:20,612 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [15], [22], [23], [27], [35], [37], [38], [41], [43], [73], [74], [75], [77], [78] [2018-12-08 14:59:20,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:59:20,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:59:20,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:59:20,631 INFO L272 AbstractInterpreter]: Visited 20 different actions 28 times. Merged at 2 different actions 2 times. Never widened. Performed 167 root evaluator evaluations with a maximum evaluation depth of 4. Performed 167 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-08 14:59:20,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:20,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:59:20,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:20,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:59:20,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:20,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:59:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:20,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:20,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 14:59:20,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:20,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:20,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:59:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 14:59:20,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 14:59:20,792 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:59:20,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [8] total 14 [2018-12-08 14:59:20,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:20,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:59:20,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:59:20,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-08 14:59:20,793 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 6 states. [2018-12-08 14:59:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:20,848 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-12-08 14:59:20,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:59:20,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-08 14:59:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:20,849 INFO L225 Difference]: With dead ends: 75 [2018-12-08 14:59:20,849 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 14:59:20,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-12-08 14:59:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 14:59:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-12-08 14:59:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 14:59:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-08 14:59:20,853 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 23 [2018-12-08 14:59:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:20,853 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-08 14:59:20,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:59:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-08 14:59:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 14:59:20,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:20,853 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:20,853 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:20,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2018-12-08 14:59:20,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 14:59:20,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:59:20,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:59:20,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:20,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:59:20,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:59:20,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:59:20,909 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 6 states. [2018-12-08 14:59:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:20,939 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-12-08 14:59:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:59:20,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-08 14:59:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:20,940 INFO L225 Difference]: With dead ends: 73 [2018-12-08 14:59:20,940 INFO L226 Difference]: Without dead ends: 73 [2018-12-08 14:59:20,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:59:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-08 14:59:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-12-08 14:59:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 14:59:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-12-08 14:59:20,943 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 26 [2018-12-08 14:59:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:20,943 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-12-08 14:59:20,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:59:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-12-08 14:59:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 14:59:20,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:20,943 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:20,943 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:20,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2018-12-08 14:59:20,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:20,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:20,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:20,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:20,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:20,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:20,982 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-08 14:59:20,982 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [12], [13], [16], [18], [22], [23], [27], [35], [37], [38], [41], [43], [73], [74], [75], [77], [78] [2018-12-08 14:59:20,983 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:59:20,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:59:21,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:59:21,025 INFO L272 AbstractInterpreter]: Visited 23 different actions 82 times. Merged at 15 different actions 38 times. Never widened. Performed 425 root evaluator evaluations with a maximum evaluation depth of 4. Performed 425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-08 14:59:21,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:21,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:59:21,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:21,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:59:21,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:21,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:59:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:21,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:21,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:59:21,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:59:21,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2018-12-08 14:59:21,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 14:59:21,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 14:59:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 14:59:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-08 14:59:21,138 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 11 states. [2018-12-08 14:59:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:21,215 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-12-08 14:59:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 14:59:21,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-12-08 14:59:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:21,216 INFO L225 Difference]: With dead ends: 105 [2018-12-08 14:59:21,216 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 14:59:21,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-08 14:59:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 14:59:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-12-08 14:59:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 14:59:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-12-08 14:59:21,220 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 27 [2018-12-08 14:59:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:21,221 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-12-08 14:59:21,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 14:59:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-12-08 14:59:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 14:59:21,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:21,222 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:21,222 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:21,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2014379143, now seen corresponding path program 2 times [2018-12-08 14:59:21,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:21,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:21,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:59:21,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:21,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:21,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 14:59:21,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 14:59:21,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:21,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:59:21,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 14:59:21,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 14:59:21,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 14:59:21,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:59:21,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:59:21,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:59:21,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:59:21,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 15 [2018-12-08 14:59:21,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 14:59:21,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 14:59:21,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 14:59:21,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-08 14:59:21,421 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 14 states. [2018-12-08 14:59:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:21,542 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-12-08 14:59:21,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 14:59:21,542 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-12-08 14:59:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:21,543 INFO L225 Difference]: With dead ends: 120 [2018-12-08 14:59:21,543 INFO L226 Difference]: Without dead ends: 120 [2018-12-08 14:59:21,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-12-08 14:59:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-08 14:59:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 86. [2018-12-08 14:59:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 14:59:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-12-08 14:59:21,548 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 38 [2018-12-08 14:59:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:21,548 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-12-08 14:59:21,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 14:59:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-12-08 14:59:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 14:59:21,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:21,549 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 14:59:21,550 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:21,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash 894123677, now seen corresponding path program 1 times [2018-12-08 14:59:21,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:21,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:21,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:59:21,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:21,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:59:21,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:21,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:21,578 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-12-08 14:59:21,578 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [33], [35], [37], [38], [41], [43], [47], [55], [58], [73], [74], [75], [77], [78] [2018-12-08 14:59:21,579 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:59:21,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:59:21,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:59:21,626 INFO L272 AbstractInterpreter]: Visited 26 different actions 115 times. Merged at 15 different actions 55 times. Widened at 1 different actions 1 times. Performed 608 root evaluator evaluations with a maximum evaluation depth of 5. Performed 608 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 10 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-08 14:59:21,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:21,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:59:21,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:21,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:59:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:21,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:59:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:21,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:59:21,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:59:21,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:59:21,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-08 14:59:21,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 14:59:21,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:59:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:59:21,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-08 14:59:21,698 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 6 states. [2018-12-08 14:59:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:21,735 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-12-08 14:59:21,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:59:21,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-08 14:59:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:21,736 INFO L225 Difference]: With dead ends: 132 [2018-12-08 14:59:21,736 INFO L226 Difference]: Without dead ends: 132 [2018-12-08 14:59:21,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-08 14:59:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-08 14:59:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2018-12-08 14:59:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 14:59:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-12-08 14:59:21,739 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 37 [2018-12-08 14:59:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:21,739 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-12-08 14:59:21,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:59:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-12-08 14:59:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 14:59:21,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:21,740 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:21,740 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:21,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 3 times [2018-12-08 14:59:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:21,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:21,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:59:21,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:21,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:21,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 14:59:21,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 14:59:21,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:21,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:59:21,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 14:59:21,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-08 14:59:21,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 14:59:21,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:59:21,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:59:21,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:59:21,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:59:21,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2018-12-08 14:59:21,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 14:59:21,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 14:59:21,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 14:59:21,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-08 14:59:21,964 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 14 states. [2018-12-08 14:59:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:22,162 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2018-12-08 14:59:22,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 14:59:22,162 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-08 14:59:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:22,163 INFO L225 Difference]: With dead ends: 117 [2018-12-08 14:59:22,163 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 14:59:22,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-12-08 14:59:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 14:59:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2018-12-08 14:59:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 14:59:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-12-08 14:59:22,168 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 43 [2018-12-08 14:59:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:22,169 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-12-08 14:59:22,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 14:59:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-12-08 14:59:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 14:59:22,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:22,170 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:22,170 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:22,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1104126516, now seen corresponding path program 1 times [2018-12-08 14:59:22,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:22,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:59:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:22,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 14:59:22,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:22,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:22,255 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-08 14:59:22,255 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [15], [16], [18], [22], [23], [27], [35], [37], [38], [41], [43], [73], [74], [75], [77], [78] [2018-12-08 14:59:22,256 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:59:22,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:59:22,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:59:22,334 INFO L272 AbstractInterpreter]: Visited 23 different actions 115 times. Merged at 15 different actions 59 times. Widened at 1 different actions 1 times. Performed 625 root evaluator evaluations with a maximum evaluation depth of 5. Performed 625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 2 different actions. Largest state had 23 variables. [2018-12-08 14:59:22,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:22,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:59:22,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:22,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/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-12-08 14:59:22,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:22,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:59:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:22,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:22,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 14:59:22,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:22,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:22,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:59:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:59:22,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:59:22,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:59:22,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 15 [2018-12-08 14:59:22,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 14:59:22,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 14:59:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 14:59:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-08 14:59:22,527 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 12 states. [2018-12-08 14:59:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:22,645 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-12-08 14:59:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 14:59:22,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-12-08 14:59:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:22,646 INFO L225 Difference]: With dead ends: 114 [2018-12-08 14:59:22,646 INFO L226 Difference]: Without dead ends: 114 [2018-12-08 14:59:22,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-12-08 14:59:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-08 14:59:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-12-08 14:59:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 14:59:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-12-08 14:59:22,649 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 44 [2018-12-08 14:59:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:22,649 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-12-08 14:59:22,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 14:59:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-12-08 14:59:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 14:59:22,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:22,650 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 14:59:22,651 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:22,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash -459259137, now seen corresponding path program 2 times [2018-12-08 14:59:22,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:22,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:22,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 14:59:22,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:22,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:22,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 14:59:22,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 14:59:22,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:22,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/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-12-08 14:59:22,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 14:59:22,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 14:59:22,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 14:59:22,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:59:22,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:22,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 14:59:22,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:22,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:22,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:59:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 14:59:22,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 14:59:22,837 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:59:22,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 13 [2018-12-08 14:59:22,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:22,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:59:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:59:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-08 14:59:22,838 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2018-12-08 14:59:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:22,859 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2018-12-08 14:59:22,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:59:22,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-08 14:59:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:22,859 INFO L225 Difference]: With dead ends: 96 [2018-12-08 14:59:22,859 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 14:59:22,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-08 14:59:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 14:59:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-08 14:59:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 14:59:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-12-08 14:59:22,862 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 48 [2018-12-08 14:59:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:22,862 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-12-08 14:59:22,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:59:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-12-08 14:59:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 14:59:22,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:22,863 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-12-08 14:59:22,863 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:22,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:22,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1976855753, now seen corresponding path program 1 times [2018-12-08 14:59:22,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:22,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:59:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:22,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 14:59:22,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:22,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:22,897 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-08 14:59:22,898 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [33], [35], [37], [38], [41], [43], [47], [55], [56], [61], [63], [72], [73], [74], [75], [77], [78] [2018-12-08 14:59:22,898 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:59:22,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:59:22,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:59:22,956 INFO L272 AbstractInterpreter]: Visited 29 different actions 118 times. Merged at 15 different actions 55 times. Widened at 1 different actions 1 times. Performed 616 root evaluator evaluations with a maximum evaluation depth of 5. Performed 616 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 10 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-08 14:59:22,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:22,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:59:22,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:22,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/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-12-08 14:59:22,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:22,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:59:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:22,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:59:23,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 14:59:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:59:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2018-12-08 14:59:23,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:23,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:59:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:59:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-08 14:59:23,073 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 6 states. [2018-12-08 14:59:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:23,123 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-08 14:59:23,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:59:23,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-08 14:59:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:23,124 INFO L225 Difference]: With dead ends: 81 [2018-12-08 14:59:23,124 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 14:59:23,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-08 14:59:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 14:59:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-12-08 14:59:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 14:59:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-12-08 14:59:23,126 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 51 [2018-12-08 14:59:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:23,126 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-12-08 14:59:23,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:59:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-12-08 14:59:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 14:59:23,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:23,127 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:23,127 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 14:59:23,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1444841842, now seen corresponding path program 2 times [2018-12-08 14:59:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:59:23,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:23,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:23,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:59:23,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:59:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 14:59:23,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:23,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:59:23,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 14:59:23,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 14:59:23,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:59:23,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:59:23,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 14:59:23,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 14:59:23,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 14:59:23,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:59:23,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:23,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:23,192 INFO L478 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 5 [2018-12-08 14:59:23,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:23,194 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-12-08 14:59:23,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-08 14:59:23,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:23,208 INFO L478 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 5 [2018-12-08 14:59:23,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:23,209 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-12-08 14:59:23,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-08 14:59:23,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:23,224 INFO L478 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 5 [2018-12-08 14:59:23,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:23,225 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-12-08 14:59:23,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-08 14:59:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-08 14:59:23,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-08 14:59:23,559 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:59:23,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 12 [2018-12-08 14:59:23,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:59:23,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:59:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:59:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-12-08 14:59:23,559 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2018-12-08 14:59:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:23,593 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-12-08 14:59:23,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:59:23,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-08 14:59:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:23,593 INFO L225 Difference]: With dead ends: 67 [2018-12-08 14:59:23,593 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 14:59:23,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2018-12-08 14:59:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 14:59:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 14:59:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 14:59:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 14:59:23,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-12-08 14:59:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:23,594 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:59:23,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:59:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:59:23,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 14:59:23,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 02:59:23 BoogieIcfgContainer [2018-12-08 14:59:23,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 14:59:23,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:59:23,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:59:23,597 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:59:23,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:59:19" (3/4) ... [2018-12-08 14:59:23,599 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 14:59:23,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 14:59:23,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-12-08 14:59:23,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 14:59:23,605 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-08 14:59:23,605 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-08 14:59:23,605 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 14:59:23,605 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 14:59:23,628 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c5afd0ea-b117-40cf-8cde-09303938194b/bin-2019/utaipan/witness.graphml [2018-12-08 14:59:23,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:59:23,628 INFO L168 Benchmark]: Toolchain (without parser) took 4921.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 953.5 MB in the beginning and 1.0 GB in the end (delta: -52.1 MB). Peak memory consumption was 249.9 MB. Max. memory is 11.5 GB. [2018-12-08 14:59:23,629 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:59:23,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.26 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:59:23,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.45 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:59:23,630 INFO L168 Benchmark]: Boogie Preprocessor took 43.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-08 14:59:23,630 INFO L168 Benchmark]: RCFGBuilder took 164.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2018-12-08 14:59:23,630 INFO L168 Benchmark]: TraceAbstraction took 4540.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:59:23,630 INFO L168 Benchmark]: Witness Printer took 31.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:59:23,631 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 126.26 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 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 13.45 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 164.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4540.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. * Witness Printer took 31.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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, 40 locations, 8 error locations. SAFE Result, 4.4s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 434 SDtfs, 860 SDslu, 1004 SDs, 0 SdLazy, 1268 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 868 GetRequests, 677 SyntacticMatches, 36 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.8756181318681318 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 3.05 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 195 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 877 NumberOfCodeBlocks, 779 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1209 ConstructedInterpolants, 87 QuantifiedInterpolants, 203170 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 35 InterpolantComputations, 14 PerfectInterpolantSequences, 598/738 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...