./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/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 32d9f155778c5c4efaa55d37fdad329bb0d271b5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:46:40,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:46:40,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:46:40,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:46:40,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:46:40,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:46:40,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:46:40,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:46:40,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:46:40,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:46:40,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:46:40,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:46:40,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:46:40,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:46:40,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:46:40,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:46:40,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:46:40,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:46:40,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:46:40,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:46:40,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:46:40,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:46:40,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:46:40,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:46:40,443 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:46:40,444 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:46:40,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:46:40,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:46:40,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:46:40,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:46:40,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:46:40,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:46:40,449 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:46:40,449 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:46:40,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:46:40,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:46:40,451 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-10-27 04:46:40,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:46:40,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:46:40,464 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:46:40,464 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:46:40,464 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:46:40,464 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:46:40,464 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:46:40,464 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:46:40,465 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:46:40,465 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:46:40,465 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:46:40,465 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:46:40,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:46:40,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:46:40,466 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:46:40,466 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:46:40,466 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:46:40,466 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:46:40,466 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:46:40,466 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:46:40,467 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:46:40,469 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:46:40,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:46:40,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:46:40,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:46:40,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:46:40,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:46:40,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:46:40,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:46:40,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:46:40,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:46:40,470 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:46:40,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:46:40,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:46:40,470 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_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/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 -> 32d9f155778c5c4efaa55d37fdad329bb0d271b5 [2018-10-27 04:46:40,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:46:40,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:46:40,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:46:40,508 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:46:40,508 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:46:40,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-10-27 04:46:40,557 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/data/5b1e9d721/645c5dd0e9d84b66946c2669ba7f6302/FLAG6c6c2bae1 [2018-10-27 04:46:40,957 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:46:40,958 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-10-27 04:46:40,962 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/data/5b1e9d721/645c5dd0e9d84b66946c2669ba7f6302/FLAG6c6c2bae1 [2018-10-27 04:46:40,974 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/data/5b1e9d721/645c5dd0e9d84b66946c2669ba7f6302 [2018-10-27 04:46:40,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:46:40,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:46:40,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:40,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:46:40,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:46:40,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:40" (1/1) ... [2018-10-27 04:46:40,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51aa830b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:40, skipping insertion in model container [2018-10-27 04:46:40,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:40" (1/1) ... [2018-10-27 04:46:40,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:46:41,011 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:46:41,128 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:41,135 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:46:41,149 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:41,161 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:46:41,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41 WrapperNode [2018-10-27 04:46:41,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:41,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:41,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:46:41,163 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:46:41,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:41,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:46:41,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:46:41,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:46:41,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... [2018-10-27 04:46:41,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:46:41,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:46:41,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:46:41,247 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:46:41,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:46:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:46:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:46:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-10-27 04:46:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-10-27 04:46:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:46:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:46:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:46:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:46:41,815 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:46:41,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:41 BoogieIcfgContainer [2018-10-27 04:46:41,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:46:41,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:46:41,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:46:41,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:46:41,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:46:40" (1/3) ... [2018-10-27 04:46:41,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f399bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:41, skipping insertion in model container [2018-10-27 04:46:41,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:41" (2/3) ... [2018-10-27 04:46:41,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f399bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:41, skipping insertion in model container [2018-10-27 04:46:41,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:41" (3/3) ... [2018-10-27 04:46:41,822 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-10-27 04:46:41,828 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:46:41,834 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-27 04:46:41,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-27 04:46:41,867 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:46:41,867 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:46:41,867 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:46:41,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:46:41,867 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:46:41,867 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:46:41,867 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:46:41,867 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:46:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-10-27 04:46:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 04:46:41,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:41,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:41,890 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:41,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-10-27 04:46:41,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:41,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:41,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:42,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:42,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:46:42,025 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:42,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:46:42,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:46:42,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:46:42,044 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-10-27 04:46:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:42,064 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-10-27 04:46:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:46:42,065 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-27 04:46:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:42,073 INFO L225 Difference]: With dead ends: 44 [2018-10-27 04:46:42,074 INFO L226 Difference]: Without dead ends: 41 [2018-10-27 04:46:42,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:46:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-27 04:46:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-27 04:46:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 04:46:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-27 04:46:42,113 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-10-27 04:46:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:42,113 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-27 04:46:42,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:46:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-27 04:46:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 04:46:42,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:42,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:42,114 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:42,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:42,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-10-27 04:46:42,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:42,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:42,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:42,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:42,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:42,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:42,224 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-10-27 04:46:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:42,322 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-10-27 04:46:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:42,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-27 04:46:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:42,324 INFO L225 Difference]: With dead ends: 61 [2018-10-27 04:46:42,324 INFO L226 Difference]: Without dead ends: 61 [2018-10-27 04:46:42,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-27 04:46:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-10-27 04:46:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-27 04:46:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-10-27 04:46:42,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-10-27 04:46:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:42,334 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-10-27 04:46:42,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-10-27 04:46:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 04:46:42,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:42,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:42,335 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:42,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-10-27 04:46:42,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:42,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:42,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:42,472 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:42,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:42,473 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2018-10-27 04:46:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:42,725 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-10-27 04:46:42,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:42,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-27 04:46:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:42,727 INFO L225 Difference]: With dead ends: 67 [2018-10-27 04:46:42,727 INFO L226 Difference]: Without dead ends: 67 [2018-10-27 04:46:42,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-27 04:46:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2018-10-27 04:46:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 04:46:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-10-27 04:46:42,737 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 13 [2018-10-27 04:46:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:42,737 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-10-27 04:46:42,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-10-27 04:46:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:46:42,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:42,738 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:42,739 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:42,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1750858933, now seen corresponding path program 1 times [2018-10-27 04:46:42,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:42,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:42,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:42,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:42,832 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 4 states. [2018-10-27 04:46:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:42,937 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-10-27 04:46:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:42,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-27 04:46:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:42,938 INFO L225 Difference]: With dead ends: 52 [2018-10-27 04:46:42,939 INFO L226 Difference]: Without dead ends: 52 [2018-10-27 04:46:42,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-27 04:46:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-27 04:46:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-27 04:46:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-10-27 04:46:42,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 17 [2018-10-27 04:46:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:42,944 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-10-27 04:46:42,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-10-27 04:46:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:46:42,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:42,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:42,946 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:42,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1557947998, now seen corresponding path program 1 times [2018-10-27 04:46:42,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:42,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:42,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:43,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:43,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:43,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:43,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:43,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:43,090 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2018-10-27 04:46:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:43,214 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-10-27 04:46:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:43,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-27 04:46:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:43,215 INFO L225 Difference]: With dead ends: 74 [2018-10-27 04:46:43,215 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 04:46:43,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 04:46:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2018-10-27 04:46:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 04:46:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-10-27 04:46:43,220 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 18 [2018-10-27 04:46:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:43,220 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-10-27 04:46:43,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-10-27 04:46:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 04:46:43,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:43,221 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:43,222 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:43,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2100054550, now seen corresponding path program 1 times [2018-10-27 04:46:43,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:43,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:43,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:43,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:43,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:43,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:43,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:43,319 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-10-27 04:46:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:43,632 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-10-27 04:46:43,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:43,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-10-27 04:46:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:43,633 INFO L225 Difference]: With dead ends: 53 [2018-10-27 04:46:43,633 INFO L226 Difference]: Without dead ends: 53 [2018-10-27 04:46:43,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-27 04:46:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-27 04:46:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 04:46:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-10-27 04:46:43,636 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 25 [2018-10-27 04:46:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:43,636 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-27 04:46:43,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-10-27 04:46:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:46:43,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:43,637 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:43,637 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:43,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 762421795, now seen corresponding path program 1 times [2018-10-27 04:46:43,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:43,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:43,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:43,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:43,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:43,730 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-27 04:46:43,731 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-10-27 04:46:43,775 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:43,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:44,042 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:46:44,043 INFO L272 AbstractInterpreter]: Visited 21 different actions 31 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-10-27 04:46:44,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:44,079 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:46:44,347 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 77.61% of their original sizes. [2018-10-27 04:46:44,347 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:46:45,997 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-10-27 04:46:45,998 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:46:45,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:45,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 22 [2018-10-27 04:46:45,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:45,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:46:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:46:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:45,999 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 18 states. [2018-10-27 04:46:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:49,920 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-10-27 04:46:49,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:46:49,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-10-27 04:46:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:49,922 INFO L225 Difference]: With dead ends: 102 [2018-10-27 04:46:49,922 INFO L226 Difference]: Without dead ends: 102 [2018-10-27 04:46:49,923 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:46:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-27 04:46:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 79. [2018-10-27 04:46:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 04:46:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-10-27 04:46:49,929 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 26 [2018-10-27 04:46:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:49,929 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-10-27 04:46:49,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:46:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-10-27 04:46:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 04:46:49,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:49,930 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:49,930 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:49,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2134728086, now seen corresponding path program 1 times [2018-10-27 04:46:49,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:49,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:49,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:46:50,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:50,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:50,065 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-27 04:46:50,065 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-10-27 04:46:50,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:50,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:50,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:50,111 INFO L272 AbstractInterpreter]: Visited 22 different actions 32 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-10-27 04:46:50,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:50,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:50,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:50,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:50,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:50,128 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:46:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:50,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:50,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:46:50,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:50,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:50,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:46:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:46:50,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:46:50,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:50,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 7 [2018-10-27 04:46:50,560 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:50,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:46:50,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:46:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:46:50,560 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 8 states. [2018-10-27 04:46:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:50,803 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-10-27 04:46:50,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:50,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-27 04:46:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:50,804 INFO L225 Difference]: With dead ends: 81 [2018-10-27 04:46:50,804 INFO L226 Difference]: Without dead ends: 81 [2018-10-27 04:46:50,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-27 04:46:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-10-27 04:46:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 04:46:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-27 04:46:50,811 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 27 [2018-10-27 04:46:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:50,812 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-27 04:46:50,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:46:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-27 04:46:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:46:50,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:50,813 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:50,813 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:50,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:50,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1752061179, now seen corresponding path program 1 times [2018-10-27 04:46:50,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:46:50,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:50,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:50,907 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-27 04:46:50,907 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [16], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-10-27 04:46:50,909 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:50,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:50,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:50,960 INFO L272 AbstractInterpreter]: Visited 23 different actions 33 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-10-27 04:46:50,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:50,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:50,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:50,979 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/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-10-27 04:46:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:50,986 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:46:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:51,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:51,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:46:51,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-27 04:46:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:46:51,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:46:51,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:51,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2018-10-27 04:46:51,259 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:51,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:46:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:46:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:51,260 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 13 states. [2018-10-27 04:46:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:51,431 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-10-27 04:46:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:46:51,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-10-27 04:46:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:51,432 INFO L225 Difference]: With dead ends: 80 [2018-10-27 04:46:51,432 INFO L226 Difference]: Without dead ends: 80 [2018-10-27 04:46:51,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:46:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-27 04:46:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-10-27 04:46:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 04:46:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-10-27 04:46:51,437 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 28 [2018-10-27 04:46:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:51,437 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-10-27 04:46:51,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:46:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-10-27 04:46:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:46:51,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:51,438 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:51,439 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:51,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash -395434466, now seen corresponding path program 1 times [2018-10-27 04:46:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:46:51,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:51,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:51,527 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-27 04:46:51,527 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [23], [24], [28], [32], [37], [39], [41], [42], [43], [45], [77], [78], [79], [81], [82] [2018-10-27 04:46:51,528 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:51,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:51,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:51,574 INFO L272 AbstractInterpreter]: Visited 20 different actions 29 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-10-27 04:46:51,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:51,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:51,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:51,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:51,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:51,623 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:46:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:51,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:46:51,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:46:51,755 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:51,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 10 [2018-10-27 04:46:51,756 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:51,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:51,756 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 6 states. [2018-10-27 04:46:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:51,831 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-10-27 04:46:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:51,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 04:46:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:51,832 INFO L225 Difference]: With dead ends: 91 [2018-10-27 04:46:51,832 INFO L226 Difference]: Without dead ends: 85 [2018-10-27 04:46:51,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-27 04:46:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-10-27 04:46:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-27 04:46:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-10-27 04:46:51,836 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 31 [2018-10-27 04:46:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:51,837 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-10-27 04:46:51,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-10-27 04:46:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:46:51,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:51,837 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:51,840 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:51,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash -786337030, now seen corresponding path program 1 times [2018-10-27 04:46:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:51,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:51,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:51,917 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 04:46:51,917 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-10-27 04:46:51,918 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:51,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:54,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:46:54,774 INFO L272 AbstractInterpreter]: Visited 25 different actions 913 times. Merged at 16 different actions 657 times. Widened at 2 different actions 23 times. Found 66 fixpoints after 5 different actions. Largest state had 30 variables. [2018-10-27 04:46:54,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:54,817 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:46:54,920 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 76.67% of their original sizes. [2018-10-27 04:46:54,920 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:46:55,189 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-10-27 04:46:55,190 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:46:55,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [8] total 24 [2018-10-27 04:46:55,190 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:55,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:46:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:46:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:55,191 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 18 states. [2018-10-27 04:46:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:58,238 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-10-27 04:46:58,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:46:58,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-10-27 04:46:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:58,239 INFO L225 Difference]: With dead ends: 56 [2018-10-27 04:46:58,239 INFO L226 Difference]: Without dead ends: 56 [2018-10-27 04:46:58,239 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:46:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-27 04:46:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-10-27 04:46:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 04:46:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-10-27 04:46:58,242 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 32 [2018-10-27 04:46:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:58,242 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-10-27 04:46:58,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:46:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-10-27 04:46:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:46:58,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:58,244 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:58,244 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:58,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1727904857, now seen corresponding path program 1 times [2018-10-27 04:46:58,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:58,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:58,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:46:58,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:58,453 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:58,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-27 04:46:58,453 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [42], [43], [45], [77], [78], [79], [81], [82] [2018-10-27 04:46:58,454 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:58,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:01,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:01,159 INFO L272 AbstractInterpreter]: Visited 25 different actions 891 times. Merged at 17 different actions 695 times. Widened at 2 different actions 23 times. Found 66 fixpoints after 5 different actions. Largest state had 30 variables. [2018-10-27 04:47:01,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:01,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:01,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:01,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:47:01,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:01,222 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:01,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:01,438 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 04:47:01,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:47:01,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-10-27 04:47:01,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:47:01,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:01,475 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-10-27 04:47:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:47:01,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:47:01,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:01,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2018-10-27 04:47:01,714 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:01,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:47:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:47:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:47:01,714 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 12 states. [2018-10-27 04:47:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:02,012 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-10-27 04:47:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:47:02,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-10-27 04:47:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:02,014 INFO L225 Difference]: With dead ends: 79 [2018-10-27 04:47:02,014 INFO L226 Difference]: Without dead ends: 79 [2018-10-27 04:47:02,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2018-10-27 04:47:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-27 04:47:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-10-27 04:47:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-27 04:47:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-10-27 04:47:02,018 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 37 [2018-10-27 04:47:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:02,019 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-10-27 04:47:02,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:47:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-10-27 04:47:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 04:47:02,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:02,023 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:02,023 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:02,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1049401958, now seen corresponding path program 1 times [2018-10-27 04:47:02,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:02,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:02,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:02,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:02,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 04:47:02,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:02,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:02,141 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-10-27 04:47:02,142 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [61], [77], [78], [79], [81], [82] [2018-10-27 04:47:02,143 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:02,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:03,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:03,894 INFO L272 AbstractInterpreter]: Visited 30 different actions 870 times. Merged at 16 different actions 657 times. Widened at 2 different actions 23 times. Found 66 fixpoints after 5 different actions. Largest state had 33 variables. [2018-10-27 04:47:03,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:03,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:03,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:03,903 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/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-10-27 04:47:03,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:03,910 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:03,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 04:47:03,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 04:47:04,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:04,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14 [2018-10-27 04:47:04,105 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:04,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:47:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:47:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:47:04,106 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 12 states. [2018-10-27 04:47:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:04,346 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-10-27 04:47:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:47:04,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-10-27 04:47:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:04,348 INFO L225 Difference]: With dead ends: 146 [2018-10-27 04:47:04,348 INFO L226 Difference]: Without dead ends: 146 [2018-10-27 04:47:04,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:47:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-27 04:47:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-10-27 04:47:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-27 04:47:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-10-27 04:47:04,352 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 64 [2018-10-27 04:47:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:04,353 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-10-27 04:47:04,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:47:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-10-27 04:47:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 04:47:04,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:04,354 INFO L375 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:04,355 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:04,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1853198671, now seen corresponding path program 2 times [2018-10-27 04:47:04,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:04,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:04,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-27 04:47:04,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:04,444 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:04,444 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:04,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:04,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:04,444 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:04,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:04,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:04,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:04,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:04,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:04,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:47:04,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-10-27 04:47:04,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:47:04,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,506 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-10-27 04:47:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-10-27 04:47:04,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-10-27 04:47:05,002 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:05,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 14 [2018-10-27 04:47:05,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:05,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:05,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:47:05,004 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 6 states. [2018-10-27 04:47:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:05,046 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-10-27 04:47:05,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:05,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-10-27 04:47:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:05,047 INFO L225 Difference]: With dead ends: 103 [2018-10-27 04:47:05,047 INFO L226 Difference]: Without dead ends: 103 [2018-10-27 04:47:05,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:47:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-27 04:47:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-27 04:47:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 04:47:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-10-27 04:47:05,052 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 95 [2018-10-27 04:47:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:05,052 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-10-27 04:47:05,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-10-27 04:47:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-27 04:47:05,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:05,054 INFO L375 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:05,054 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:05,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1132079386, now seen corresponding path program 1 times [2018-10-27 04:47:05,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:05,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:05,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-27 04:47:05,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:05,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:05,181 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2018-10-27 04:47:05,181 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [62], [65], [67], [76], [77], [78], [79], [81], [82] [2018-10-27 04:47:05,182 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:05,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:07,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:07,488 INFO L272 AbstractInterpreter]: Visited 33 different actions 873 times. Merged at 16 different actions 657 times. Widened at 2 different actions 23 times. Found 66 fixpoints after 5 different actions. Largest state had 39 variables. [2018-10-27 04:47:07,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:07,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:07,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:07,495 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:07,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:07,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:07,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 119 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 04:47:07,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 119 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 04:47:07,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:07,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 18 [2018-10-27 04:47:07,748 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:07,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:47:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:47:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:07,749 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 15 states. [2018-10-27 04:47:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:08,179 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-10-27 04:47:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:47:08,180 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2018-10-27 04:47:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:08,181 INFO L225 Difference]: With dead ends: 203 [2018-10-27 04:47:08,181 INFO L226 Difference]: Without dead ends: 203 [2018-10-27 04:47:08,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-27 04:47:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-27 04:47:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 140. [2018-10-27 04:47:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-27 04:47:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2018-10-27 04:47:08,185 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 98 [2018-10-27 04:47:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:08,186 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2018-10-27 04:47:08,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:47:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2018-10-27 04:47:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 04:47:08,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:08,190 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:08,190 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:08,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash 232179866, now seen corresponding path program 2 times [2018-10-27 04:47:08,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-10-27 04:47:08,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:08,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:08,301 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:08,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:08,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:08,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:08,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:08,309 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:08,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:08,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:08,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:08,351 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-27 04:47:08,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-27 04:47:08,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:08,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:08,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-27 04:47:08,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-27 04:47:08,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:08,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:08,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-27 04:47:08,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-27 04:47:08,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:08,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:08,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-27 04:47:08,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-27 04:47:08,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:08,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:08,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-10-27 04:47:08,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:47:08,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:08,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-10-27 04:47:08,680 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int) (|v_main_~#b~0.base_16| Int)) (let ((.cse0 (store |c_old(#valid)| |v_main_~#b~0.base_16| 1))) (and (= (select .cse0 main_ULTIMATE.dealloc_~addr.base) 0) (= 0 (select |c_old(#valid)| |v_main_~#b~0.base_16|)) (= |c_#valid| (store (store (store .cse0 main_ULTIMATE.dealloc_~addr.base 1) |v_main_~#b~0.base_16| 0) main_ULTIMATE.dealloc_~addr.base 0))))) is different from true [2018-10-27 04:47:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-10-27 04:47:08,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:08,753 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_~#b~0.base_18| Int) (|v_main_#Ultimate.alloc_#res.base_10| Int)) (let ((.cse0 (store |c_#valid| |v_main_~#b~0.base_18| 1))) (or (= (store (store (store .cse0 |v_main_#Ultimate.alloc_#res.base_10| 1) |v_main_~#b~0.base_18| 0) |v_main_#Ultimate.alloc_#res.base_10| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#Ultimate.alloc_#res.base_10|) 0)) (not (= 0 (select |c_#valid| |v_main_~#b~0.base_18|)))))) is different from false [2018-10-27 04:47:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-10-27 04:47:08,835 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:08,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [8] total 14 [2018-10-27 04:47:08,835 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:08,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=96, Unknown=2, NotChecked=42, Total=182 [2018-10-27 04:47:08,836 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand 6 states. [2018-10-27 04:47:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:09,034 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-10-27 04:47:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:09,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-27 04:47:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:09,035 INFO L225 Difference]: With dead ends: 140 [2018-10-27 04:47:09,035 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 04:47:09,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 256 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=139, Unknown=2, NotChecked=50, Total=240 [2018-10-27 04:47:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 04:47:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 04:47:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 04:47:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 04:47:09,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2018-10-27 04:47:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:09,036 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 04:47:09,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 04:47:09,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 04:47:09,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:47:09 BoogieIcfgContainer [2018-10-27 04:47:09,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:47:09,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:47:09,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:47:09,041 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:47:09,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:41" (3/4) ... [2018-10-27 04:47:09,045 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 04:47:09,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 04:47:09,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-10-27 04:47:09,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 04:47:09,054 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2018-10-27 04:47:09,055 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-10-27 04:47:09,055 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-10-27 04:47:09,095 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d40fd4bc-bf8d-43a4-af59-2573ef0d3013/bin-2019/utaipan/witness.graphml [2018-10-27 04:47:09,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:47:09,096 INFO L168 Benchmark]: Toolchain (without parser) took 28119.01 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 955.9 MB in the beginning and 1.3 GB in the end (delta: -369.8 MB). Peak memory consumption was 996.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:09,098 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:09,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.25 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:09,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.38 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 942.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:09,100 INFO L168 Benchmark]: Boogie Preprocessor took 40.78 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:09,100 INFO L168 Benchmark]: RCFGBuilder took 568.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:09,100 INFO L168 Benchmark]: TraceAbstraction took 27224.81 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-10-27 04:47:09,100 INFO L168 Benchmark]: Witness Printer took 54.19 ms. Allocated memory is still 2.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:09,102 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.25 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 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 43.38 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 942.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.78 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 568.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27224.81 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 54.19 ms. Allocated memory is still 2.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: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 8 error locations. SAFE Result, 27.1s OverallTime, 16 OverallIterations, 14 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 541 SDtfs, 1318 SDslu, 1460 SDs, 0 SdLazy, 1335 SolverSat, 277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1211 GetRequests, 981 SyntacticMatches, 37 SemanticMatches, 193 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.3s AbstIntTime, 8 AbstIntIterations, 2 AbstIntStrong, 0.9318170426065162 AbsIntWeakeningRatio, 1.7142857142857142 AbsIntAvgWeakeningVarsNumRemoved, 128.23214285714286 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 221 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 983 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1667 ConstructedInterpolants, 203 QuantifiedInterpolants, 760972 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1347 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 2520/2782 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...