./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:46:25,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:46:25,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:46:25,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:46:25,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:46:25,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:46:25,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:46:25,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:46:25,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:46:25,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:46:25,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:46:25,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:46:25,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:46:25,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:46:25,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:46:25,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:46:25,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:46:25,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:46:25,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:46:25,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:46:25,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:46:25,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:46:25,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:46:25,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:46:25,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:46:25,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:46:25,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:46:25,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:46:25,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:46:25,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:46:25,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:46:25,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:46:25,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:46:25,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:46:25,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:46:25,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:46:25,416 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-10-27 04:46:25,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:46:25,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:46:25,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:46:25,429 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:46:25,429 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:46:25,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:46:25,429 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:46:25,429 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:46:25,429 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:46:25,429 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:46:25,430 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:46:25,430 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:46:25,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:46:25,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:46:25,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:46:25,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:46:25,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:46:25,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:46:25,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:46:25,431 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:46:25,431 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:46:25,432 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:46:25,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:46:25,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:46:25,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:46:25,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:46:25,434 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:46:25,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:46:25,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:46:25,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:46:25,435 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:46:25,435 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:46:25,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:46:25,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:46:25,435 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_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2018-10-27 04:46:25,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:46:25,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:46:25,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:46:25,475 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:46:25,475 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:46:25,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-10-27 04:46:25,519 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/data/6ff602af9/bf4ea5fa34d24c8eace125e09608e736/FLAGc5b5e1fa0 [2018-10-27 04:46:25,887 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:46:25,887 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-10-27 04:46:25,892 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/data/6ff602af9/bf4ea5fa34d24c8eace125e09608e736/FLAGc5b5e1fa0 [2018-10-27 04:46:25,904 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/data/6ff602af9/bf4ea5fa34d24c8eace125e09608e736 [2018-10-27 04:46:25,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:46:25,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:46:25,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:25,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:46:25,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:46:25,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:25" (1/1) ... [2018-10-27 04:46:25,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2db716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:25, skipping insertion in model container [2018-10-27 04:46:25,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:25" (1/1) ... [2018-10-27 04:46:25,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:46:25,937 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:46:26,049 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:26,056 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:46:26,070 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:26,082 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:46:26,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:26 WrapperNode [2018-10-27 04:46:26,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:26,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:26,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:46:26,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:46:26,092 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:26" (1/1) ... [2018-10-27 04:46:26,099 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:26" (1/1) ... [2018-10-27 04:46:26,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:26,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:46:26,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:46:26,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:46:26,125 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:26" (1/1) ... [2018-10-27 04:46:26,126 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:26" (1/1) ... [2018-10-27 04:46:26,127 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:26" (1/1) ... [2018-10-27 04:46:26,127 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:26" (1/1) ... [2018-10-27 04:46:26,133 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:26" (1/1) ... [2018-10-27 04:46:26,137 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:26" (1/1) ... [2018-10-27 04:46:26,138 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:26" (1/1) ... [2018-10-27 04:46:26,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:46:26,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:46:26,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:46:26,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:46:26,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/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:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:46:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:46:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-10-27 04:46:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-10-27 04:46:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:46:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:46:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:46:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:46:26,639 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:46:26,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:26 BoogieIcfgContainer [2018-10-27 04:46:26,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:46:26,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:46:26,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:46:26,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:46:26,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:46:25" (1/3) ... [2018-10-27 04:46:26,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b28eef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:26, skipping insertion in model container [2018-10-27 04:46:26,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:26" (2/3) ... [2018-10-27 04:46:26,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b28eef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:26, skipping insertion in model container [2018-10-27 04:46:26,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:26" (3/3) ... [2018-10-27 04:46:26,646 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-10-27 04:46:26,653 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:46:26,659 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-27 04:46:26,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-27 04:46:26,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:46:26,693 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:46:26,693 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:46:26,693 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:46:26,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:46:26,694 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:46:26,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:46:26,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:46:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-10-27 04:46:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 04:46:26,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:26,714 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:26,716 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:26,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-10-27 04:46:26,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:26,832 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:26,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:26,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:46:26,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:26,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:46:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:46:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:46:26,851 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-10-27 04:46:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:26,863 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-10-27 04:46:26,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:46:26,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-27 04:46:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:26,871 INFO L225 Difference]: With dead ends: 44 [2018-10-27 04:46:26,871 INFO L226 Difference]: Without dead ends: 41 [2018-10-27 04:46:26,872 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:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-27 04:46:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-27 04:46:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 04:46:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-27 04:46:26,902 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-10-27 04:46:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:26,903 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-27 04:46:26,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:46:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-27 04:46:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 04:46:26,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:26,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:26,904 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:26,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-10-27 04:46:26,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:26,974 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:26,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:26,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:26,975 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:26,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:26,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:26,976 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-10-27 04:46:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:27,077 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-10-27 04:46:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:27,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-27 04:46:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:27,079 INFO L225 Difference]: With dead ends: 61 [2018-10-27 04:46:27,079 INFO L226 Difference]: Without dead ends: 61 [2018-10-27 04:46:27,080 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:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-27 04:46:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-10-27 04:46:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-27 04:46:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-10-27 04:46:27,089 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-10-27 04:46:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:27,089 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-10-27 04:46:27,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-10-27 04:46:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 04:46:27,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:27,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:27,090 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:27,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-10-27 04:46:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:27,221 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:27,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:27,222 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:27,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:27,222 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2018-10-27 04:46:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:27,456 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-10-27 04:46:27,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:27,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-27 04:46:27,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:27,459 INFO L225 Difference]: With dead ends: 67 [2018-10-27 04:46:27,459 INFO L226 Difference]: Without dead ends: 67 [2018-10-27 04:46:27,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-27 04:46:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2018-10-27 04:46:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 04:46:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-10-27 04:46:27,465 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 13 [2018-10-27 04:46:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:27,465 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-10-27 04:46:27,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-10-27 04:46:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:46:27,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:27,466 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:27,466 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:27,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1750858933, now seen corresponding path program 1 times [2018-10-27 04:46:27,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,468 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:27,549 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:27,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:27,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:27,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:27,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:27,551 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 4 states. [2018-10-27 04:46:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:27,592 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-10-27 04:46:27,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:27,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-27 04:46:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:27,593 INFO L225 Difference]: With dead ends: 52 [2018-10-27 04:46:27,593 INFO L226 Difference]: Without dead ends: 52 [2018-10-27 04:46:27,594 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:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-27 04:46:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-27 04:46:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-27 04:46:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-10-27 04:46:27,597 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 17 [2018-10-27 04:46:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:27,597 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-10-27 04:46:27,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-10-27 04:46:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:46:27,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:27,598 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:27,598 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:27,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1557947998, now seen corresponding path program 1 times [2018-10-27 04:46:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:27,730 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:27,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:27,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:27,730 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:27,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:27,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:27,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:27,731 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2018-10-27 04:46:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:27,879 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-10-27 04:46:27,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:27,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-27 04:46:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:27,881 INFO L225 Difference]: With dead ends: 74 [2018-10-27 04:46:27,881 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 04:46:27,882 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:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 04:46:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2018-10-27 04:46:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 04:46:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-10-27 04:46:27,893 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 18 [2018-10-27 04:46:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:27,893 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-10-27 04:46:27,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-10-27 04:46:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 04:46:27,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:27,894 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:27,895 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:27,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:27,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2100054550, now seen corresponding path program 1 times [2018-10-27 04:46:27,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:27,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:27,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:46:27,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:27,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:27,963 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:27,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:27,964 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2018-10-27 04:46:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:27,998 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-10-27 04:46:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:27,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-27 04:46:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:27,999 INFO L225 Difference]: With dead ends: 53 [2018-10-27 04:46:27,999 INFO L226 Difference]: Without dead ends: 53 [2018-10-27 04:46:27,999 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:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-27 04:46:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-27 04:46:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 04:46:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-10-27 04:46:28,002 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 25 [2018-10-27 04:46:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:28,002 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-27 04:46:28,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-10-27 04:46:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:46:28,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:28,003 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:28,003 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:28,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash 762421795, now seen corresponding path program 1 times [2018-10-27 04:46:28,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:28,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:28,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:46:28,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:28,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:46:28,242 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:28,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:28,243 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 5 states. [2018-10-27 04:46:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:28,374 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-10-27 04:46:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:28,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-27 04:46:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:28,376 INFO L225 Difference]: With dead ends: 64 [2018-10-27 04:46:28,376 INFO L226 Difference]: Without dead ends: 64 [2018-10-27 04:46:28,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-27 04:46:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-10-27 04:46:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 04:46:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-27 04:46:28,382 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 26 [2018-10-27 04:46:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:28,382 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-27 04:46:28,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-27 04:46:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:46:28,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:28,383 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, 1] [2018-10-27 04:46:28,384 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 677181702, now seen corresponding path program 1 times [2018-10-27 04:46:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:28,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:28,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:28,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:28,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:28,426 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-27 04:46:28,427 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [61], [77], [78], [79], [81], [82] [2018-10-27 04:46:28,463 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:28,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:28,694 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:46:28,696 INFO L272 AbstractInterpreter]: Visited 20 different actions 30 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-10-27 04:46:28,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:28,712 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:46:28,893 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 76.65% of their original sizes. [2018-10-27 04:46:28,893 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:46:30,342 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-10-27 04:46:30,342 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:46:30,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:30,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-27 04:46:30,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:30,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:46:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:46:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:46:30,344 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 13 states. [2018-10-27 04:46:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:32,666 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-10-27 04:46:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:46:32,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-10-27 04:46:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:32,667 INFO L225 Difference]: With dead ends: 93 [2018-10-27 04:46:32,667 INFO L226 Difference]: Without dead ends: 93 [2018-10-27 04:46:32,667 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-27 04:46:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2018-10-27 04:46:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 04:46:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-10-27 04:46:32,677 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 26 [2018-10-27 04:46:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:32,677 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-10-27 04:46:32,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:46:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-10-27 04:46:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 04:46:32,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:32,678 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:32,678 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:32,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2134728086, now seen corresponding path program 1 times [2018-10-27 04:46:32,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:32,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:32,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:46:32,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:32,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:32,844 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:32,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:32,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:32,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:32,845 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2018-10-27 04:46:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:33,009 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-10-27 04:46:33,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:33,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-27 04:46:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:33,010 INFO L225 Difference]: With dead ends: 81 [2018-10-27 04:46:33,010 INFO L226 Difference]: Without dead ends: 81 [2018-10-27 04:46:33,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:46:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-27 04:46:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-10-27 04:46:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 04:46:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-27 04:46:33,014 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 27 [2018-10-27 04:46:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:33,015 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-27 04:46:33,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-27 04:46:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:46:33,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:33,016 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:33,016 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:33,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1752061179, now seen corresponding path program 1 times [2018-10-27 04:46:33,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:33,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:33,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:46:33,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:33,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:33,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:33,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:33,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:33,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:33,144 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 6 states. [2018-10-27 04:46:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:33,257 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-10-27 04:46:33,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:33,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-27 04:46:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:33,258 INFO L225 Difference]: With dead ends: 100 [2018-10-27 04:46:33,258 INFO L226 Difference]: Without dead ends: 100 [2018-10-27 04:46:33,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-27 04:46:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-10-27 04:46:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-27 04:46:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-10-27 04:46:33,264 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 28 [2018-10-27 04:46:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:33,265 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-10-27 04:46:33,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-10-27 04:46:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:46:33,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:33,266 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:33,266 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:33,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash -395434466, now seen corresponding path program 1 times [2018-10-27 04:46:33,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:33,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:33,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:33,345 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:33,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:33,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:46:33,345 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:33,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:46:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:46:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:33,346 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 9 states. [2018-10-27 04:46:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:33,514 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-10-27 04:46:33,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:46:33,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-10-27 04:46:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:33,515 INFO L225 Difference]: With dead ends: 90 [2018-10-27 04:46:33,515 INFO L226 Difference]: Without dead ends: 84 [2018-10-27 04:46:33,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:46:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-27 04:46:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2018-10-27 04:46:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 04:46:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-10-27 04:46:33,518 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 31 [2018-10-27 04:46:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:33,518 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-10-27 04:46:33,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:46:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-10-27 04:46:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:46:33,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:33,519 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:33,519 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:33,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -786337030, now seen corresponding path program 1 times [2018-10-27 04:46:33,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:33,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:33,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:33,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:33,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:33,566 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:33,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:33,566 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:33,566 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 04:46:33,567 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:33,568 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:33,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:35,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:46:35,671 INFO L272 AbstractInterpreter]: Visited 25 different actions 603 times. Merged at 16 different actions 425 times. Widened at 2 different actions 10 times. Found 42 fixpoints after 4 different actions. Largest state had 27 variables. [2018-10-27 04:46:35,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:35,716 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:46:35,802 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 79.73% of their original sizes. [2018-10-27 04:46:35,803 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:46:36,527 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-10-27 04:46:36,527 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:46:36,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:36,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-10-27 04:46:36,527 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:36,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:46:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:46:36,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:46:36,528 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 16 states. [2018-10-27 04:46:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:38,585 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-10-27 04:46:38,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:46:38,585 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-10-27 04:46:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:38,585 INFO L225 Difference]: With dead ends: 59 [2018-10-27 04:46:38,585 INFO L226 Difference]: Without dead ends: 59 [2018-10-27 04:46:38,586 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:46:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-27 04:46:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-27 04:46:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 04:46:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-10-27 04:46:38,593 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 32 [2018-10-27 04:46:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:38,593 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-10-27 04:46:38,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:46:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-10-27 04:46:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 04:46:38,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:38,594 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:38,594 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:38,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash 244359708, now seen corresponding path program 1 times [2018-10-27 04:46:38,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:38,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:39,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:39,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:39,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-27 04:46:39,278 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [16], [17], [19], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-10-27 04:46:39,280 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:39,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:41,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:41,523 INFO L272 AbstractInterpreter]: Visited 25 different actions 603 times. Merged at 17 different actions 454 times. Widened at 2 different actions 10 times. Found 42 fixpoints after 4 different actions. Largest state had 27 variables. [2018-10-27 04:46:41,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:41,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:41,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:41,533 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/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:41,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:41,556 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:46:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:41,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:41,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:42,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:42,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2018-10-27 04:46:42,079 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:42,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:46:42,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:46:42,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:42,080 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 11 states. [2018-10-27 04:46:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:42,230 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-10-27 04:46:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:46:42,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-10-27 04:46:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:42,231 INFO L225 Difference]: With dead ends: 95 [2018-10-27 04:46:42,231 INFO L226 Difference]: Without dead ends: 95 [2018-10-27 04:46:42,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:46:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-27 04:46:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-10-27 04:46:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 04:46:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-10-27 04:46:42,234 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 34 [2018-10-27 04:46:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:42,235 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-10-27 04:46:42,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:46:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-10-27 04:46:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:46:42,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:42,236 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:42,236 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:42,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1727904857, now seen corresponding path program 1 times [2018-10-27 04:46:42,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:46:42,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:42,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:42,371 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-27 04:46:42,371 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:42,372 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:42,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:44,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:44,533 INFO L272 AbstractInterpreter]: Visited 25 different actions 597 times. Merged at 17 different actions 455 times. Widened at 2 different actions 10 times. Found 42 fixpoints after 4 different actions. Largest state had 27 variables. [2018-10-27 04:46:44,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:44,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:44,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:44,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:46:44,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:44,595 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:44,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:44,692 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:44,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:44,821 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:44,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-10-27 04:46:45,116 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 04:46:45,784 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:46:46,448 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:46:46,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:46,946 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:46:46,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:46,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2018-10-27 04:46:46,973 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:46,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:46:46,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:46:46,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:46:46,974 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 12 states. [2018-10-27 04:46:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:47,725 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-10-27 04:46:47,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:46:47,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-10-27 04:46:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:47,726 INFO L225 Difference]: With dead ends: 127 [2018-10-27 04:46:47,727 INFO L226 Difference]: Without dead ends: 127 [2018-10-27 04:46:47,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:46:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-27 04:46:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 77. [2018-10-27 04:46:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 04:46:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-10-27 04:46:47,731 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 37 [2018-10-27 04:46:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:47,731 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-10-27 04:46:47,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:46:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-10-27 04:46:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:46:47,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:47,735 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:47,735 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:47,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:47,735 INFO L82 PathProgramCache]: Analyzing trace with hash -891716273, now seen corresponding path program 1 times [2018-10-27 04:46:47,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:47,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:47,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:46:47,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:47,871 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:47,871 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-27 04:46:47,871 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [61], [77], [78], [79], [81], [82] [2018-10-27 04:46:47,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:47,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:49,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:49,867 INFO L272 AbstractInterpreter]: Visited 30 different actions 580 times. Merged at 16 different actions 425 times. Widened at 2 different actions 10 times. Found 42 fixpoints after 4 different actions. Largest state had 28 variables. [2018-10-27 04:46:49,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:49,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:49,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:49,905 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:46:49,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:49,917 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:49,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:46:50,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:46:50,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:50,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-10-27 04:46:50,741 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:50,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:50,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:50,742 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2018-10-27 04:46:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:51,378 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-10-27 04:46:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:51,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-10-27 04:46:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:51,380 INFO L225 Difference]: With dead ends: 110 [2018-10-27 04:46:51,380 INFO L226 Difference]: Without dead ends: 110 [2018-10-27 04:46:51,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-27 04:46:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2018-10-27 04:46:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-27 04:46:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-10-27 04:46:51,383 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 45 [2018-10-27 04:46:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:51,383 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-10-27 04:46:51,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-10-27 04:46:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 04:46:51,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:51,394 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:51,394 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:51,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 97308005, now seen corresponding path program 2 times [2018-10-27 04:46:51,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:51,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:52,441 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:46:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 04:46:53,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:53,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:53,253 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:46:53,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:46:53,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:53,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/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:46:53,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:46:53,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:53,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:46:53,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:53,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:53,321 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:53,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:53,419 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:53,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-27 04:46:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 04:46:53,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 04:46:54,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:54,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2018-10-27 04:46:54,512 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:54,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:46:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:46:54,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:46:54,513 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 17 states. [2018-10-27 04:46:55,004 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-10-27 04:46:55,247 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-10-27 04:46:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:55,346 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-10-27 04:46:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:46:55,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-10-27 04:46:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:55,348 INFO L225 Difference]: With dead ends: 95 [2018-10-27 04:46:55,348 INFO L226 Difference]: Without dead ends: 95 [2018-10-27 04:46:55,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-27 04:46:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-27 04:46:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-10-27 04:46:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 04:46:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-10-27 04:46:55,353 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 53 [2018-10-27 04:46:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:55,353 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-10-27 04:46:55,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:46:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-10-27 04:46:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 04:46:55,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:55,354 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:46:55,355 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:55,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1049401958, now seen corresponding path program 2 times [2018-10-27 04:46:55,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:55,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:55,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:55,756 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:46:55,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:55,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:55,757 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:46:55,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:46:55,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:55,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/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:46:55,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:46:55,767 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:46:55,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:46:55,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:55,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:55,817 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:55,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:55,925 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:55,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-27 04:46:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-27 04:46:56,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-27 04:46:56,392 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:56,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 13 [2018-10-27 04:46:56,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:56,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:56,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:46:56,393 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 6 states. [2018-10-27 04:46:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:56,481 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-10-27 04:46:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:56,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-10-27 04:46:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:56,483 INFO L225 Difference]: With dead ends: 84 [2018-10-27 04:46:56,483 INFO L226 Difference]: Without dead ends: 84 [2018-10-27 04:46:56,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:46:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-27 04:46:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-10-27 04:46:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-27 04:46:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-10-27 04:46:56,485 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 64 [2018-10-27 04:46:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:56,485 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-10-27 04:46:56,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-10-27 04:46:56,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 04:46:56,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:56,487 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, 1, 1, 1] [2018-10-27 04:46:56,487 INFO L424 AbstractCegarLoop]: === Iteration 18 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:56,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:56,487 INFO L82 PathProgramCache]: Analyzing trace with hash -333122397, now seen corresponding path program 1 times [2018-10-27 04:46:56,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:56,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:56,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:56,636 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:46:56,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:56,636 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:56,636 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-10-27 04:46:56,637 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [62], [65], [67], [76], [77], [78], [79], [81], [82] [2018-10-27 04:46:56,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:46:56,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:46:58,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:46:58,689 INFO L272 AbstractInterpreter]: Visited 33 different actions 583 times. Merged at 16 different actions 425 times. Widened at 2 different actions 10 times. Found 42 fixpoints after 4 different actions. Largest state had 34 variables. [2018-10-27 04:46:58,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:58,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:46:58,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:58,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:58,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:58,743 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:46:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:58,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:58,914 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:46:58,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:46:58,984 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:46:59,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:46:59,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14 [2018-10-27 04:46:59,001 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:46:59,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:46:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:46:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:46:59,001 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 12 states. [2018-10-27 04:46:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:59,234 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-10-27 04:46:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:46:59,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-10-27 04:46:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:59,235 INFO L225 Difference]: With dead ends: 131 [2018-10-27 04:46:59,235 INFO L226 Difference]: Without dead ends: 128 [2018-10-27 04:46:59,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:46:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-27 04:46:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 103. [2018-10-27 04:46:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 04:46:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-10-27 04:46:59,239 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 67 [2018-10-27 04:46:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:59,239 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-10-27 04:46:59,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:46:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-10-27 04:46:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-27 04:46:59,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:59,244 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:46:59,245 INFO L424 AbstractCegarLoop]: === Iteration 19 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:59,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1132079386, now seen corresponding path program 2 times [2018-10-27 04:46:59,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:59,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:59,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:59,805 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:46:59,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:59,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:46:59,806 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:46:59,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:46:59,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:59,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:46:59,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:46:59,816 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:59,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:46:59,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:59,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:00,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:00,023 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 5 [2018-10-27 04:47:00,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:00,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:00,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-10-27 04:47:00,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:00,053 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 5 [2018-10-27 04:47:00,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:00,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:00,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-10-27 04:47:00,069 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:00,070 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 5 [2018-10-27 04:47:00,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:00,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:00,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-10-27 04:47:00,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:00,089 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 5 [2018-10-27 04:47:00,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:00,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:00,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-10-27 04:47:00,144 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base)))) is different from true [2018-10-27 04:47:00,155 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:00,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:00,179 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#Ultimate.alloc_#res.base_8| Int)) (or (not (= 0 (select |c_#valid| |v_main_#Ultimate.alloc_#res.base_8|))) (= (store |c_#valid| |v_main_#Ultimate.alloc_#res.base_8| 0) |c_old(#valid)|))) is different from false [2018-10-27 04:47:00,185 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:00,202 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:00,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 13 [2018-10-27 04:47:00,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:00,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=81, Unknown=2, NotChecked=38, Total=156 [2018-10-27 04:47:00,203 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 6 states. [2018-10-27 04:47:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:00,249 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-10-27 04:47:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:00,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-10-27 04:47:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:00,250 INFO L225 Difference]: With dead ends: 103 [2018-10-27 04:47:00,250 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 04:47:00,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 184 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2018-10-27 04:47:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 04:47:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 04:47:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 04:47:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 04:47:00,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-10-27 04:47:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:00,251 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 04:47:00,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 04:47:00,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 04:47:00,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:47:00 BoogieIcfgContainer [2018-10-27 04:47:00,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:47:00,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:47:00,256 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:47:00,256 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:47:00,256 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:26" (3/4) ... [2018-10-27 04:47:00,259 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 04:47:00,262 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 04:47:00,263 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-10-27 04:47:00,263 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 04:47:00,267 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2018-10-27 04:47:00,267 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-10-27 04:47:00,267 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-27 04:47:00,300 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_27420cea-2951-4334-b124-6169a1110c89/bin-2019/utaipan/witness.graphml [2018-10-27 04:47:00,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:47:00,301 INFO L168 Benchmark]: Toolchain (without parser) took 34394.29 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 960.7 MB in the beginning and 1.3 GB in the end (delta: -341.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-10-27 04:47:00,302 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:00,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.34 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 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:00,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.58 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 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:00,302 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:00,303 INFO L168 Benchmark]: RCFGBuilder took 499.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:00,303 INFO L168 Benchmark]: TraceAbstraction took 33614.45 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: -157.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-10-27 04:47:00,303 INFO L168 Benchmark]: Witness Printer took 44.93 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:00,309 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.34 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 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 33.58 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.94 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 499.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33614.45 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: -157.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 44.93 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: -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: 15]: 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: 20]: 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 - 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, 33.5s OverallTime, 19 OverallIterations, 9 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 597 SDtfs, 1238 SDslu, 1482 SDs, 0 SdLazy, 1458 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 998 GetRequests, 776 SyntacticMatches, 30 SemanticMatches, 192 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.0s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.9429289493575208 AbsIntWeakeningRatio, 1.4285714285714286 AbsIntAvgWeakeningVarsNumRemoved, 131.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 242 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1427 ConstructedInterpolants, 176 QuantifiedInterpolants, 398055 SizeOfPredicates, 38 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 1081/1278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...