./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56b28f59847d63942ec468b0c95f39e5b8c0763a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:48:33,572 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:48:33,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:48:33,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:48:33,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:48:33,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:48:33,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:48:33,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:48:33,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:48:33,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:48:33,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:48:33,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:48:33,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:48:33,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:48:33,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:48:33,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:48:33,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:48:33,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:48:33,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:48:33,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:48:33,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:48:33,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:48:33,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:48:33,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:48:33,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:48:33,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:48:33,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:48:33,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:48:33,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:48:33,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:48:33,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:48:33,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:48:33,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:48:33,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:48:33,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:48:33,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:48:33,601 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 15:48:33,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:48:33,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:48:33,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:48:33,612 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:48:33,612 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:48:33,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:48:33,613 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:48:33,613 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:48:33,613 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:48:33,613 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:48:33,613 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:48:33,613 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:48:33,613 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:48:33,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:48:33,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:48:33,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:48:33,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:48:33,614 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:48:33,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:48:33,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:48:33,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:48:33,616 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:48:33,616 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:48:33,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:48:33,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:48:33,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:48:33,616 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:48:33,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:48:33,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:48:33,616 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_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2018-12-09 15:48:33,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:48:33,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:48:33,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:48:33,644 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:48:33,644 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:48:33,645 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-12-09 15:48:33,682 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/data/7317b198a/2c23f2fe730744e3bdd1863b4dc7c75b/FLAGb727ba6ea [2018-12-09 15:48:34,107 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:48:34,107 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-12-09 15:48:34,111 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/data/7317b198a/2c23f2fe730744e3bdd1863b4dc7c75b/FLAGb727ba6ea [2018-12-09 15:48:34,119 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/data/7317b198a/2c23f2fe730744e3bdd1863b4dc7c75b [2018-12-09 15:48:34,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:48:34,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:48:34,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:48:34,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:48:34,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:48:34,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651df91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34, skipping insertion in model container [2018-12-09 15:48:34,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:48:34,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:48:34,227 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:48:34,233 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:48:34,242 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:48:34,251 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:48:34,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34 WrapperNode [2018-12-09 15:48:34,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:48:34,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:48:34,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:48:34,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:48:34,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:48:34,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:48:34,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:48:34,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:48:34,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... [2018-12-09 15:48:34,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:48:34,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:48:34,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:48:34,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:48:34,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:48:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:48:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:48:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:48:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-12-09 15:48:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-12-09 15:48:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:48:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:48:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 15:48:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:48:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:48:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:48:34,476 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:48:34,476 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 15:48:34,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:48:34 BoogieIcfgContainer [2018-12-09 15:48:34,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:48:34,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:48:34,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:48:34,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:48:34,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:48:34" (1/3) ... [2018-12-09 15:48:34,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe6bc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:48:34, skipping insertion in model container [2018-12-09 15:48:34,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:48:34" (2/3) ... [2018-12-09 15:48:34,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe6bc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:48:34, skipping insertion in model container [2018-12-09 15:48:34,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:48:34" (3/3) ... [2018-12-09 15:48:34,483 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-12-09 15:48:34,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:48:34,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-12-09 15:48:34,504 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-12-09 15:48:34,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:48:34,520 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 15:48:34,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:48:34,520 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:48:34,520 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:48:34,520 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:48:34,520 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:48:34,520 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:48:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-09 15:48:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 15:48:34,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:34,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:34,538 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:34,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-12-09 15:48:34,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:34,628 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-09 15:48:34,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:34,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:48:34,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:34,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:48:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:48:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:48:34,642 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-09 15:48:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:34,681 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-12-09 15:48:34,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:48:34,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 15:48:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:34,690 INFO L225 Difference]: With dead ends: 58 [2018-12-09 15:48:34,690 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 15:48:34,692 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-09 15:48:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 15:48:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-12-09 15:48:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 15:48:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-09 15:48:34,717 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-12-09 15:48:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:34,718 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-09 15:48:34,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:48:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-09 15:48:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:48:34,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:34,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:34,719 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:34,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:34,719 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-12-09 15:48:34,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:34,748 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-09 15:48:34,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:34,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:48:34,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:34,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:48:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:48:34,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:48:34,750 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-12-09 15:48:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:34,771 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-09 15:48:34,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:48:34,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 15:48:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:34,773 INFO L225 Difference]: With dead ends: 49 [2018-12-09 15:48:34,773 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 15:48:34,773 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-09 15:48:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 15:48:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-12-09 15:48:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 15:48:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-09 15:48:34,776 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2018-12-09 15:48:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:34,776 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 15:48:34,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:48:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-09 15:48:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 15:48:34,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:34,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:34,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:34,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2018-12-09 15:48:34,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:34,812 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-09 15:48:34,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:34,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:48:34,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:34,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:34,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:34,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:34,813 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-12-09 15:48:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:34,849 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-09 15:48:34,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:34,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-09 15:48:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:34,850 INFO L225 Difference]: With dead ends: 40 [2018-12-09 15:48:34,850 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 15:48:34,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 15:48:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 15:48:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 15:48:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-09 15:48:34,853 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2018-12-09 15:48:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:34,853 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 15:48:34,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-09 15:48:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 15:48:34,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:34,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:34,853 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:34,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2018-12-09 15:48:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:34,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:34,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:34,907 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-09 15:48:34,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:34,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:34,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:34,908 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-12-09 15:48:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:34,962 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-12-09 15:48:34,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:48:34,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-09 15:48:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:34,963 INFO L225 Difference]: With dead ends: 42 [2018-12-09 15:48:34,963 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 15:48:34,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:48:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 15:48:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-12-09 15:48:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 15:48:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 15:48:34,967 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2018-12-09 15:48:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:34,967 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 15:48:34,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-09 15:48:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 15:48:34,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:34,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:34,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:34,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-12-09 15:48:34,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:34,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:34,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:34,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,028 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-09 15:48:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:35,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:35,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:35,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:35,029 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2018-12-09 15:48:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:35,087 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-09 15:48:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:35,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 15:48:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:35,088 INFO L225 Difference]: With dead ends: 60 [2018-12-09 15:48:35,088 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 15:48:35,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 15:48:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2018-12-09 15:48:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 15:48:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 15:48:35,092 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2018-12-09 15:48:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:35,092 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 15:48:35,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 15:48:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 15:48:35,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:35,092 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:35,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:35,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2018-12-09 15:48:35,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:35,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:48:35,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:35,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:48:35,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:35,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:48:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:48:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:35,128 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-12-09 15:48:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:35,189 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-12-09 15:48:35,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:48:35,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 15:48:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:35,190 INFO L225 Difference]: With dead ends: 70 [2018-12-09 15:48:35,190 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 15:48:35,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:48:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 15:48:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-12-09 15:48:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 15:48:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-09 15:48:35,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-12-09 15:48:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:35,194 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-09 15:48:35,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:48:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-09 15:48:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:48:35,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:35,194 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] [2018-12-09 15:48:35,195 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:35,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2018-12-09 15:48:35,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 15:48:35,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:35,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:48:35,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:35,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:48:35,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:48:35,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:48:35,226 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-12-09 15:48:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:35,235 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-12-09 15:48:35,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:48:35,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 15:48:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:35,236 INFO L225 Difference]: With dead ends: 48 [2018-12-09 15:48:35,237 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 15:48:35,237 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-09 15:48:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 15:48:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 15:48:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 15:48:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-09 15:48:35,239 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 20 [2018-12-09 15:48:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:35,240 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-09 15:48:35,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:48:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-09 15:48:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:48:35,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:35,240 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] [2018-12-09 15:48:35,241 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:35,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234190, now seen corresponding path program 1 times [2018-12-09 15:48:35,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:35,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 15:48:35,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:35,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:48:35,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:35,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:48:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:48:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:48:35,263 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2018-12-09 15:48:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:35,279 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-12-09 15:48:35,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:48:35,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 15:48:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:35,280 INFO L225 Difference]: With dead ends: 52 [2018-12-09 15:48:35,281 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 15:48:35,281 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-09 15:48:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 15:48:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-12-09 15:48:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 15:48:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-09 15:48:35,283 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 20 [2018-12-09 15:48:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:35,284 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-09 15:48:35,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:48:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-09 15:48:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 15:48:35,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:35,284 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, 1, 1, 1, 1, 1] [2018-12-09 15:48:35,285 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:35,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2011781567, now seen corresponding path program 1 times [2018-12-09 15:48:35,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 15:48:35,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:35,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:35,304 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 15:48:35,305 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-09 15:48:35,324 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:48:35,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:48:35,486 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:48:35,487 INFO L272 AbstractInterpreter]: Visited 26 different actions 95 times. Merged at 14 different actions 42 times. Widened at 1 different actions 1 times. Performed 463 root evaluator evaluations with a maximum evaluation depth of 4. Performed 463 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 21 variables. [2018-12-09 15:48:35,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:48:35,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:35,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:35,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:48:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 15:48:35,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 15:48:35,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:48:35,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-09 15:48:35,575 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:48:35,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:35,576 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-12-09 15:48:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:35,605 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-12-09 15:48:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:48:35,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 15:48:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:35,607 INFO L225 Difference]: With dead ends: 74 [2018-12-09 15:48:35,607 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 15:48:35,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 15:48:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-12-09 15:48:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 15:48:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-12-09 15:48:35,611 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 26 [2018-12-09 15:48:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:35,612 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-12-09 15:48:35,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-12-09 15:48:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 15:48:35,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:35,613 INFO L402 BasicCegarLoop]: trace histogram [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-09 15:48:35,613 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:35,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1143280978, now seen corresponding path program 1 times [2018-12-09 15:48:35,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:48:35,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:35,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:35,667 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 15:48:35,667 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [35], [37], [38], [40], [41], [43], [73], [74], [75], [77], [78] [2018-12-09 15:48:35,668 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:48:35,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:48:35,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:48:35,760 INFO L272 AbstractInterpreter]: Visited 23 different actions 113 times. Merged at 15 different actions 54 times. Widened at 1 different actions 1 times. Performed 592 root evaluator evaluations with a maximum evaluation depth of 4. Performed 592 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 3 different actions. Largest state had 21 variables. [2018-12-09 15:48:35,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:48:35,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:35,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:35,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:48:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:35,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:48:35,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:48:35,900 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:48:35,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-12-09 15:48:35,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:35,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:35,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:48:35,901 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2018-12-09 15:48:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:35,960 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-09 15:48:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:48:35,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-09 15:48:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:35,961 INFO L225 Difference]: With dead ends: 67 [2018-12-09 15:48:35,961 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 15:48:35,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 15:48:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-12-09 15:48:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 15:48:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-09 15:48:35,964 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-12-09 15:48:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:35,964 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-09 15:48:35,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-09 15:48:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 15:48:35,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:35,965 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:35,965 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1735380924, now seen corresponding path program 1 times [2018-12-09 15:48:35,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:35,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:35,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:48:36,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:36,003 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-09 15:48:36,003 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-09 15:48:36,004 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:48:36,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:48:36,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:48:36,060 INFO L272 AbstractInterpreter]: Visited 23 different actions 109 times. Merged at 14 different actions 44 times. Never widened. Performed 563 root evaluator evaluations with a maximum evaluation depth of 4. Performed 563 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 3 different actions. Largest state had 21 variables. [2018-12-09 15:48:36,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:36,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:48:36,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:36,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:36,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:48:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:36,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 15:48:36,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 15:48:36,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:48:36,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11 [2018-12-09 15:48:36,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:48:36,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:48:36,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:48:36,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:36,146 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 10 states. [2018-12-09 15:48:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:36,237 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-12-09 15:48:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:48:36,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-09 15:48:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:36,237 INFO L225 Difference]: With dead ends: 73 [2018-12-09 15:48:36,237 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 15:48:36,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-12-09 15:48:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 15:48:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-12-09 15:48:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 15:48:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-12-09 15:48:36,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 32 [2018-12-09 15:48:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:36,240 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-12-09 15:48:36,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:48:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-12-09 15:48:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:48:36,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:36,241 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:36,241 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:36,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1978883467, now seen corresponding path program 2 times [2018-12-09 15:48:36,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:36,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:36,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:36,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:48:36,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:36,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:48:36,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:48:36,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:36,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:48:36,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:48:36,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 15:48:36,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:48:36,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:48:36,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:48:36,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:48:36,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-12-09 15:48:36,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:48:36,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:48:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:48:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:36,408 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 10 states. [2018-12-09 15:48:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:36,508 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-12-09 15:48:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:48:36,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-09 15:48:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:36,509 INFO L225 Difference]: With dead ends: 71 [2018-12-09 15:48:36,509 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 15:48:36,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:48:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 15:48:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-12-09 15:48:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:48:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-09 15:48:36,512 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 36 [2018-12-09 15:48:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:36,512 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-09 15:48:36,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:48:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-09 15:48:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 15:48:36,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:36,513 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:36,513 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:36,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1930842354, now seen corresponding path program 3 times [2018-12-09 15:48:36,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:36,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:36,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:48:36,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:36,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 15:48:36,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:36,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:48:36,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:48:36,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:36,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 15:48:36,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 15:48:36,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 15:48:36,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:48:36,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:36,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:48:36,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:48:36,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:48:36,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:48:36,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 15:48:36,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:48:36,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:48:36,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:48:36,641 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-12-09 15:48:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:48:36,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:48:36,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:48:36,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2018-12-09 15:48:36,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:48:36,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:48:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:48:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:36,796 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-12-09 15:48:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:36,873 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-12-09 15:48:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:48:36,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-12-09 15:48:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:36,873 INFO L225 Difference]: With dead ends: 65 [2018-12-09 15:48:36,874 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 15:48:36,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:48:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 15:48:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-09 15:48:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 15:48:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-09 15:48:36,876 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2018-12-09 15:48:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:36,876 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-09 15:48:36,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:48:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-09 15:48:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 15:48:36,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:36,877 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, 1, 1, 1] [2018-12-09 15:48:36,878 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:36,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash 492189859, now seen corresponding path program 2 times [2018-12-09 15:48:36,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:36,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:36,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:48:36,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:36,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:48:36,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:36,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:48:36,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:48:36,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:36,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:36,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:48:36,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:48:36,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 15:48:36,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:48:36,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:36,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:48:36,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:48:36,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 15:48:36,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:48:36,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:48:36,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:48:36,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:48:36,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:48:36,949 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2018-12-09 15:48:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-09 15:48:37,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-09 15:48:37,126 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:48:37,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 12 [2018-12-09 15:48:37,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:37,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:37,128 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 6 states. [2018-12-09 15:48:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:37,153 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-12-09 15:48:37,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:37,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 15:48:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:37,154 INFO L225 Difference]: With dead ends: 61 [2018-12-09 15:48:37,154 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 15:48:37,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 15:48:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-12-09 15:48:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 15:48:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-12-09 15:48:37,157 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 47 [2018-12-09 15:48:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:37,157 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-12-09 15:48:37,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-12-09 15:48:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 15:48:37,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:37,158 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, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:37,158 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:37,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash -190258011, now seen corresponding path program 1 times [2018-12-09 15:48:37,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:37,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:48:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:37,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:48:37,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:37,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:37,179 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-09 15:48:37,179 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-09 15:48:37,180 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:48:37,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:48:37,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:48:37,216 INFO L272 AbstractInterpreter]: Visited 29 different actions 89 times. Merged at 14 different actions 34 times. Never widened. Performed 432 root evaluator evaluations with a maximum evaluation depth of 4. Performed 432 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 21 variables. [2018-12-09 15:48:37,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:37,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:48:37,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:37,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:37,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:37,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:48:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:37,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:48:37,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:48:37,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:48:37,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 15:48:37,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:48:37,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:37,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:37,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:48:37,312 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-12-09 15:48:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:37,350 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-12-09 15:48:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:37,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-09 15:48:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:37,351 INFO L225 Difference]: With dead ends: 85 [2018-12-09 15:48:37,351 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 15:48:37,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 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-09 15:48:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 15:48:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2018-12-09 15:48:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 15:48:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-12-09 15:48:37,354 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 50 [2018-12-09 15:48:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:37,354 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-12-09 15:48:37,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-12-09 15:48:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 15:48:37,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:37,356 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:37,356 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 15:48:37,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1277143159, now seen corresponding path program 2 times [2018-12-09 15:48:37,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:48:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:37,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:37,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:48:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-09 15:48:37,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:37,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:48:37,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:48:37,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:48:37,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:48:37,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/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-09 15:48:37,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:48:37,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:48:37,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 15:48:37,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:48:37,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:48:37,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:48:37,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 15:48:37,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 15:48:37,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:48:37,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:48:37,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 15:48:37,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-12-09 15:48:37,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:48:37,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 15:48:37,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 15:48:37,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:48:37,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:48:37,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 15:48:37,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-12-09 15:48:37,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:48:37,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 15:48:37,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 15:48:37,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:48:37,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:48:37,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 15:48:37,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-12-09 15:48:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-09 15:48:38,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:48:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-09 15:48:38,207 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:48:38,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 12 [2018-12-09 15:48:38,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:48:38,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:38,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:38,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-12-09 15:48:38,208 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-12-09 15:48:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:38,250 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-12-09 15:48:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:48:38,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-09 15:48:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:38,251 INFO L225 Difference]: With dead ends: 67 [2018-12-09 15:48:38,251 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 15:48:38,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2018-12-09 15:48:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 15:48:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 15:48:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 15:48:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 15:48:38,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-12-09 15:48:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:38,252 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:48:38,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:48:38,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 15:48:38,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:48:38 BoogieIcfgContainer [2018-12-09 15:48:38,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:48:38,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:48:38,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:48:38,255 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:48:38,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:48:34" (3/4) ... [2018-12-09 15:48:38,257 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 15:48:38,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 15:48:38,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-12-09 15:48:38,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 15:48:38,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-09 15:48:38,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-09 15:48:38,264 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 15:48:38,264 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 15:48:38,287 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5e75d96-6d25-46e8-8410-46650b2da40c/bin-2019/utaipan/witness.graphml [2018-12-09 15:48:38,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:48:38,287 INFO L168 Benchmark]: Toolchain (without parser) took 4166.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 953.5 MB in the beginning and 1.3 GB in the end (delta: -353.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:48:38,288 INFO L168 Benchmark]: CDTParser took 0.14 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-09 15:48:38,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.01 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-09 15:48:38,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.99 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-09 15:48:38,289 INFO L168 Benchmark]: Boogie Preprocessor took 44.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:38,289 INFO L168 Benchmark]: RCFGBuilder took 166.79 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:38,290 INFO L168 Benchmark]: TraceAbstraction took 3777.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:38,290 INFO L168 Benchmark]: Witness Printer took 32.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:48:38,292 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.14 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 129.01 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.99 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 44.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.79 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3777.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Witness Printer took 32.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - 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, 3.7s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 414 SDtfs, 493 SDslu, 820 SDs, 0 SdLazy, 1031 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 630 SyntacticMatches, 19 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 134 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 784 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1086 ConstructedInterpolants, 132 QuantifiedInterpolants, 247854 SizeOfPredicates, 14 NumberOfNonLiveVariables, 828 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 32 InterpolantComputations, 14 PerfectInterpolantSequences, 651/739 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...