./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/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 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:05:23,672 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:05:23,673 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:05:23,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:05:23,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:05:23,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:05:23,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:05:23,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:05:23,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:05:23,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:05:23,686 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:05:23,686 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:05:23,687 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:05:23,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:05:23,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:05:23,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:05:23,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:05:23,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:05:23,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:05:23,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:05:23,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:05:23,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:05:23,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:05:23,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:05:23,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:05:23,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:05:23,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:05:23,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:05:23,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:05:23,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:05:23,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:05:23,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:05:23,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:05:23,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:05:23,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:05:23,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:05:23,699 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 15:05:23,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:05:23,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:05:23,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:05:23,710 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:05:23,710 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 15:05:23,710 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 15:05:23,711 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 15:05:23,711 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 15:05:23,711 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 15:05:23,711 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 15:05:23,711 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 15:05:23,711 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 15:05:23,711 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 15:05:23,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:05:23,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:05:23,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:05:23,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:05:23,713 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:05:23,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:05:23,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:05:23,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:05:23,713 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 15:05:23,713 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 15:05:23,714 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 15:05:23,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:05:23,714 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:05:23,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:05:23,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:05:23,714 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:05:23,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:05:23,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:05:23,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:05:23,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:05:23,715 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 15:05:23,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:05:23,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:05:23,716 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_9a44a8ce-16d4-4a60-92cd-36929f710ab5/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 -> 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 [2018-12-02 15:05:23,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:05:23,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:05:23,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:05:23,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:05:23,752 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:05:23,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-12-02 15:05:23,788 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/data/ee5809a03/b1f4be4d379c43fb8c0241f37919e147/FLAGc3a78ceb3 [2018-12-02 15:05:24,176 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:05:24,177 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-12-02 15:05:24,180 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/data/ee5809a03/b1f4be4d379c43fb8c0241f37919e147/FLAGc3a78ceb3 [2018-12-02 15:05:24,189 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/data/ee5809a03/b1f4be4d379c43fb8c0241f37919e147 [2018-12-02 15:05:24,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:05:24,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:05:24,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:05:24,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:05:24,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:05:24,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557be19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24, skipping insertion in model container [2018-12-02 15:05:24,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:05:24,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:05:24,294 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:05:24,300 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:05:24,310 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:05:24,318 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:05:24,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24 WrapperNode [2018-12-02 15:05:24,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:05:24,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:05:24,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:05:24,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:05:24,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:05:24,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:05:24,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:05:24,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:05:24,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... [2018-12-02 15:05:24,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:05:24,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:05:24,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:05:24,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:05:24,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:05:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:05:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:05:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:05:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:05:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-12-02 15:05:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-12-02 15:05:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:05:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:05:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:05:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:05:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:05:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:05:24,533 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:05:24,533 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 15:05:24,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:05:24 BoogieIcfgContainer [2018-12-02 15:05:24,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:05:24,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:05:24,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:05:24,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:05:24,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:05:24" (1/3) ... [2018-12-02 15:05:24,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74807ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:05:24, skipping insertion in model container [2018-12-02 15:05:24,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:24" (2/3) ... [2018-12-02 15:05:24,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74807ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:05:24, skipping insertion in model container [2018-12-02 15:05:24,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:05:24" (3/3) ... [2018-12-02 15:05:24,538 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-12-02 15:05:24,544 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:05:24,548 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-12-02 15:05:24,557 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-12-02 15:05:24,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:05:24,571 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 15:05:24,571 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:05:24,571 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:05:24,571 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:05:24,571 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:05:24,571 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:05:24,571 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:05:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-02 15:05:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 15:05:24,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:24,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:24,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:24,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-12-02 15:05:24,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:24,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:05:24,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:05:24,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:24,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:05:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:05:24,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:05:24,688 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-02 15:05:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:24,722 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-12-02 15:05:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:05:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 15:05:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:24,730 INFO L225 Difference]: With dead ends: 58 [2018-12-02 15:05:24,730 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 15:05:24,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:05:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 15:05:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-12-02 15:05:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 15:05:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-02 15:05:24,754 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-12-02 15:05:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:24,754 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-02 15:05:24,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:05:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-02 15:05:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 15:05:24,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:24,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:24,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:24,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-12-02 15:05:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:24,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:24,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:05:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:05:24,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:24,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:05:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:05:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:05:24,788 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-12-02 15:05:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:24,818 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-02 15:05:24,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:05:24,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 15:05:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:24,820 INFO L225 Difference]: With dead ends: 49 [2018-12-02 15:05:24,821 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 15:05:24,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:05:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 15:05:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-12-02 15:05:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 15:05:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-02 15:05:24,825 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2018-12-02 15:05:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:24,826 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-02 15:05:24,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:05:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-02 15:05:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 15:05:24,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:24,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:24,827 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:24,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2018-12-02 15:05:24,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:24,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:24,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:05:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:05:24,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:24,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:05:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:05:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:05:24,873 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-12-02 15:05:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:24,908 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-02 15:05:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:05:24,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-02 15:05:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:24,909 INFO L225 Difference]: With dead ends: 40 [2018-12-02 15:05:24,909 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 15:05:24,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:05:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 15:05:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 15:05:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 15:05:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-02 15:05:24,912 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2018-12-02 15:05:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:24,912 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-02 15:05:24,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:05:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-02 15:05:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 15:05:24,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:24,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:24,913 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:24,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2018-12-02 15:05:24,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:24,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:24,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:24,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:24,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:05:24,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:05:24,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:24,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:05:24,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:05:24,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:05:24,977 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-12-02 15:05:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:25,035 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-12-02 15:05:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:05:25,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-02 15:05:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:25,035 INFO L225 Difference]: With dead ends: 42 [2018-12-02 15:05:25,035 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 15:05:25,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:05:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 15:05:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-12-02 15:05:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 15:05:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-02 15:05:25,038 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2018-12-02 15:05:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:25,038 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 15:05:25,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:05:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-02 15:05:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 15:05:25,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:25,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:25,039 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:25,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-12-02 15:05:25,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:25,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:25,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:05:25,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:05:25,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:25,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:05:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:05:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:05:25,083 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2018-12-02 15:05:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:25,112 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-12-02 15:05:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:05:25,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-02 15:05:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:25,114 INFO L225 Difference]: With dead ends: 45 [2018-12-02 15:05:25,114 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 15:05:25,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:05:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 15:05:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-12-02 15:05:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 15:05:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-02 15:05:25,117 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2018-12-02 15:05:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:25,117 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-02 15:05:25,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:05:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-02 15:05:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 15:05:25,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:25,118 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:25,118 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:25,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2018-12-02 15:05:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:25,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:25,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:25,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:25,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:05:25,180 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-02 15:05:25,181 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [12], [13], [16], [18], [27], [35], [73], [74], [75], [77] [2018-12-02 15:05:25,202 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:05:25,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:05:25,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:05:25,324 INFO L272 AbstractInterpreter]: Visited 15 different actions 33 times. Merged at 6 different actions 16 times. Never widened. Performed 194 root evaluator evaluations with a maximum evaluation depth of 3. Performed 194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-12-02 15:05:25,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:25,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:05:25,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:25,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:25,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:25,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:05:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:25,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:25,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:25,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:05:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2018-12-02 15:05:25,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:05:25,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:05:25,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:05:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:05:25,423 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-12-02 15:05:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:25,516 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-12-02 15:05:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:05:25,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-02 15:05:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:25,517 INFO L225 Difference]: With dead ends: 47 [2018-12-02 15:05:25,517 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 15:05:25,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-12-02 15:05:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 15:05:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-02 15:05:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 15:05:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-12-02 15:05:25,521 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2018-12-02 15:05:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:25,521 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-12-02 15:05:25,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:05:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-12-02 15:05:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 15:05:25,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:25,522 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:25,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:25,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2018-12-02 15:05:25,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:25,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:25,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:05:25,628 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 15:05:25,628 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [35], [37], [39], [73], [74], [75], [77], [78] [2018-12-02 15:05:25,629 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:05:25,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:05:25,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:05:25,659 INFO L272 AbstractInterpreter]: Visited 20 different actions 32 times. Merged at 5 different actions 10 times. Never widened. Performed 160 root evaluator evaluations with a maximum evaluation depth of 3. Performed 160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 15:05:25,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:25,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:05:25,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:25,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:25,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:25,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:05:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:25,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:25,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:05:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2018-12-02 15:05:25,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:05:25,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 15:05:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:05:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-12-02 15:05:25,826 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-12-02 15:05:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:25,965 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-12-02 15:05:25,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:05:25,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-12-02 15:05:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:25,966 INFO L225 Difference]: With dead ends: 59 [2018-12-02 15:05:25,966 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 15:05:25,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-12-02 15:05:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 15:05:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-02 15:05:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 15:05:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-12-02 15:05:25,969 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2018-12-02 15:05:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:25,969 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-12-02 15:05:25,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 15:05:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-12-02 15:05:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:05:25,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:25,970 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:25,970 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:25,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723374, now seen corresponding path program 2 times [2018-12-02 15:05:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:25,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:26,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:26,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:05:26,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 15:05:26,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 15:05:26,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:26,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:26,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:05:26,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 15:05:26,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 15:05:26,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:05:26,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:26,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:05:26,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 15:05:26,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 15:05:26,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:05:26,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:05:26,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:05:26,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-02 15:05:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 15:05:26,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 15:05:26,249 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:05:26,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [8] total 11 [2018-12-02 15:05:26,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:26,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:05:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:05:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:05:26,250 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 4 states. [2018-12-02 15:05:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:26,267 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-12-02 15:05:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:05:26,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 15:05:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:26,268 INFO L225 Difference]: With dead ends: 50 [2018-12-02 15:05:26,268 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 15:05:26,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:05:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 15:05:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-02 15:05:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 15:05:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-12-02 15:05:26,270 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 35 [2018-12-02 15:05:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:26,270 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-12-02 15:05:26,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:05:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-12-02 15:05:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:05:26,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:26,271 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:26,271 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:26,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723375, now seen corresponding path program 1 times [2018-12-02 15:05:26,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:26,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:05:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:26,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:26,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:26,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:05:26,381 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-02 15:05:26,381 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [35], [37], [40], [73], [74], [75], [77], [78] [2018-12-02 15:05:26,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:05:26,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:05:26,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:05:26,415 INFO L272 AbstractInterpreter]: Visited 20 different actions 43 times. Merged at 11 different actions 21 times. Never widened. Performed 219 root evaluator evaluations with a maximum evaluation depth of 4. Performed 219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 15:05:26,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:26,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:05:26,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:26,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:26,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:26,423 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:05:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:26,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:26,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:26,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:05:26,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2018-12-02 15:05:26,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:05:26,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 15:05:26,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 15:05:26,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-02 15:05:26,614 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 14 states. [2018-12-02 15:05:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:26,742 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-12-02 15:05:26,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:05:26,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-02 15:05:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:26,743 INFO L225 Difference]: With dead ends: 62 [2018-12-02 15:05:26,743 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 15:05:26,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-12-02 15:05:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 15:05:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-12-02 15:05:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 15:05:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-12-02 15:05:26,746 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 35 [2018-12-02 15:05:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:26,746 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-12-02 15:05:26,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 15:05:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-12-02 15:05:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:05:26,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:26,747 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:26,747 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:26,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:26,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1819430834, now seen corresponding path program 2 times [2018-12-02 15:05:26,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:26,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:26,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:26,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:26,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:26,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:26,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:05:26,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 15:05:26,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 15:05:26,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:26,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:26,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:05:26,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 15:05:26,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 15:05:26,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:05:26,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:26,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 15:05:26,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:05:26,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 15:05:26,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:05:26,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 15:05:26,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:05:26,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:05:26,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:05:26,913 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-12-02 15:05:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-02 15:05:26,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-02 15:05:27,026 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:05:27,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [9] total 14 [2018-12-02 15:05:27,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:27,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:05:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:05:27,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-02 15:05:27,027 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-12-02 15:05:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:27,057 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-12-02 15:05:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:05:27,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-02 15:05:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:27,058 INFO L225 Difference]: With dead ends: 53 [2018-12-02 15:05:27,058 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 15:05:27,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-02 15:05:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 15:05:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-02 15:05:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 15:05:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-12-02 15:05:27,061 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 40 [2018-12-02 15:05:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:27,062 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-12-02 15:05:27,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:05:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-12-02 15:05:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 15:05:27,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:27,063 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:27,063 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:27,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1970343113, now seen corresponding path program 1 times [2018-12-02 15:05:27,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:27,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:05:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:27,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-02 15:05:27,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:27,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:05:27,096 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-02 15:05:27,097 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [33], [35], [37], [38], [41], [43], [47], [55], [56], [61], [63], [72], [73], [74], [75], [77], [78] [2018-12-02 15:05:27,098 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:05:27,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:05:27,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:05:27,223 INFO L272 AbstractInterpreter]: Visited 29 different actions 194 times. Merged at 15 different actions 117 times. Widened at 1 different actions 3 times. Performed 984 root evaluator evaluations with a maximum evaluation depth of 4. Performed 984 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 4 different actions. Largest state had 21 variables. [2018-12-02 15:05:27,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:27,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:05:27,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:27,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:27,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:27,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:05:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:27,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:27,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:27,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:05:27,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2018-12-02 15:05:27,431 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:05:27,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 15:05:27,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:05:27,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-12-02 15:05:27,432 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 11 states. [2018-12-02 15:05:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:27,516 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-12-02 15:05:27,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:05:27,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-12-02 15:05:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:27,517 INFO L225 Difference]: With dead ends: 89 [2018-12-02 15:05:27,517 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 15:05:27,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2018-12-02 15:05:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 15:05:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-12-02 15:05:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 15:05:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-12-02 15:05:27,520 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 49 [2018-12-02 15:05:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:27,521 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-12-02 15:05:27,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 15:05:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-12-02 15:05:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 15:05:27,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:27,522 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:27,522 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 15:05:27,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 86332454, now seen corresponding path program 2 times [2018-12-02 15:05:27,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:05:27,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:27,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:05:27,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:05:27,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:05:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:05:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-12-02 15:05:27,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:27,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:05:27,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 15:05:27,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 15:05:27,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:27,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:27,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:05:27,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 15:05:27,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 15:05:27,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:05:27,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:27,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:05:27,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-02 15:05:27,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 15:05:27,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:05:27,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:05:27,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:05:27,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-12-02 15:05:27,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:05:27,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-02 15:05:27,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 15:05:27,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:05:27,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:05:27,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:05:27,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-12-02 15:05:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-12-02 15:05:28,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-12-02 15:05:28,354 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:05:28,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 11 [2018-12-02 15:05:28,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:05:28,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:05:28,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:05:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2018-12-02 15:05:28,355 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2018-12-02 15:05:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:28,395 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-12-02 15:05:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:05:28,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 15:05:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:28,395 INFO L225 Difference]: With dead ends: 67 [2018-12-02 15:05:28,395 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 15:05:28,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-12-02 15:05:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 15:05:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 15:05:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 15:05:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 15:05:28,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2018-12-02 15:05:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:28,396 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:05:28,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:05:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:05:28,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 15:05:28,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:05:28 BoogieIcfgContainer [2018-12-02 15:05:28,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:05:28,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:05:28,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:05:28,399 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:05:28,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:05:24" (3/4) ... [2018-12-02 15:05:28,401 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 15:05:28,405 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 15:05:28,405 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-12-02 15:05:28,405 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 15:05:28,407 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-02 15:05:28,407 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-02 15:05:28,407 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 15:05:28,408 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 15:05:28,432 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a44a8ce-16d4-4a60-92cd-36929f710ab5/bin-2019/utaipan/witness.graphml [2018-12-02 15:05:28,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:05:28,433 INFO L168 Benchmark]: Toolchain (without parser) took 4241.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 950.8 MB in the beginning and 887.4 MB in the end (delta: 63.4 MB). Peak memory consumption was 210.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:05:28,434 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:05:28,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.91 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-12-02 15:05:28,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.15 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:05:28,434 INFO L168 Benchmark]: Boogie Preprocessor took 48.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-02 15:05:28,435 INFO L168 Benchmark]: RCFGBuilder took 150.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:05:28,435 INFO L168 Benchmark]: TraceAbstraction took 3865.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 892.2 MB in the end (delta: 189.3 MB). Peak memory consumption was 236.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:05:28,435 INFO L168 Benchmark]: Witness Printer took 33.05 ms. Allocated memory is still 1.2 GB. Free memory was 892.2 MB in the beginning and 887.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-12-02 15:05:28,437 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 126.91 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.15 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 150.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3865.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 892.2 MB in the end (delta: 189.3 MB). Peak memory consumption was 236.0 MB. Max. memory is 11.5 GB. * Witness Printer took 33.05 ms. Allocated memory is still 1.2 GB. Free memory was 892.2 MB in the beginning and 887.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: 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, 40 locations, 8 error locations. SAFE Result, 3.8s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 331 SDtfs, 366 SDslu, 1102 SDs, 0 SdLazy, 597 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 551 SyntacticMatches, 8 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 660 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 934 ConstructedInterpolants, 135 QuantifiedInterpolants, 321905 SizeOfPredicates, 11 NumberOfNonLiveVariables, 629 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 1329/1698 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...