./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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 07b05923cf5c1b39a35ab81b524575a0a488c268 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:10:29,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:10:29,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:10:29,358 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:10:29,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:10:29,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:10:29,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:10:29,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:10:29,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:10:29,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:10:29,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:10:29,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:10:29,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:10:29,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:10:29,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:10:29,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:10:29,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:10:29,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:10:29,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:10:29,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:10:29,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:10:29,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:10:29,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:10:29,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:10:29,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:10:29,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:10:29,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:10:29,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:10:29,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:10:29,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:10:29,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:10:29,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:10:29,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:10:29,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:10:29,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:10:29,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:10:29,379 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 04:10:29,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:10:29,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:10:29,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:10:29,390 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:10:29,391 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:10:29,391 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:10:29,391 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:10:29,391 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:10:29,391 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:10:29,391 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:10:29,391 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:10:29,392 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:10:29,392 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:10:29,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:10:29,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:10:29,392 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:10:29,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:10:29,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:10:29,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:10:29,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:10:29,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:10:29,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:10:29,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:10:29,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:10:29,394 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:10:29,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:10:29,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:10:29,394 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_c7307e6f-94a9-46a3-b956-615bc804f3ae/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 -> 07b05923cf5c1b39a35ab81b524575a0a488c268 [2018-11-10 04:10:29,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:10:29,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:10:29,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:10:29,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:10:29,428 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:10:29,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-11-10 04:10:29,465 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/data/cb3c7cd86/3eb6068e0aa84e1e8cbe3627836b9d53/FLAG3aab4a41f [2018-11-10 04:10:29,875 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:10:29,876 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-11-10 04:10:29,881 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/data/cb3c7cd86/3eb6068e0aa84e1e8cbe3627836b9d53/FLAG3aab4a41f [2018-11-10 04:10:29,890 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/data/cb3c7cd86/3eb6068e0aa84e1e8cbe3627836b9d53 [2018-11-10 04:10:29,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:10:29,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:10:29,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:10:29,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:10:29,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:10:29,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:10:29" (1/1) ... [2018-11-10 04:10:29,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7663048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:29, skipping insertion in model container [2018-11-10 04:10:29,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:10:29" (1/1) ... [2018-11-10 04:10:29,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:10:29,917 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:10:30,016 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:10:30,022 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:10:30,033 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:10:30,042 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:10:30,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30 WrapperNode [2018-11-10 04:10:30,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:10:30,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:10:30,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:10:30,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:10:30,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:10:30,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:10:30,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:10:30,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:10:30,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... [2018-11-10 04:10:30,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:10:30,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:10:30,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:10:30,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:10:30,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:30,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:10:30,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:10:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 04:10:30,156 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 04:10:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:10:30,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:10:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:10:30,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:10:30,329 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:10:30,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:10:30 BoogieIcfgContainer [2018-11-10 04:10:30,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:10:30,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:10:30,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:10:30,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:10:30,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:10:29" (1/3) ... [2018-11-10 04:10:30,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5a5e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:10:30, skipping insertion in model container [2018-11-10 04:10:30,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:10:30" (2/3) ... [2018-11-10 04:10:30,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5a5e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:10:30, skipping insertion in model container [2018-11-10 04:10:30,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:10:30" (3/3) ... [2018-11-10 04:10:30,336 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-11-10 04:10:30,343 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:10:30,350 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 04:10:30,363 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 04:10:30,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:10:30,385 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 04:10:30,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:10:30,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:10:30,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:10:30,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:10:30,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:10:30,385 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:10:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 04:10:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 04:10:30,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:30,403 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:30,405 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:30,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-11-10 04:10:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:30,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:30,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:10:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:10:30,493 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:30,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 04:10:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:10:30,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:10:30,505 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-10 04:10:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:30,517 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-10 04:10:30,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:10:30,518 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 04:10:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:30,525 INFO L225 Difference]: With dead ends: 44 [2018-11-10 04:10:30,525 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 04:10:30,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:10:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 04:10:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 04:10:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 04:10:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-10 04:10:30,552 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-11-10 04:10:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:30,553 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 04:10:30,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 04:10:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-10 04:10:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 04:10:30,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:30,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:30,554 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:30,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-11-10 04:10:30,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:30,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:30,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:30,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:10:30,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:10:30,604 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:30,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:10:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:10:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:10:30,606 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-11-10 04:10:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:30,632 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 04:10:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:10:30,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 04:10:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:30,634 INFO L225 Difference]: With dead ends: 61 [2018-11-10 04:10:30,634 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 04:10:30,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:10:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 04:10:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-11-10 04:10:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 04:10:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-10 04:10:30,640 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-11-10 04:10:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:30,640 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 04:10:30,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:10:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-10 04:10:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 04:10:30,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:30,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:30,641 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:30,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:30,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-11-10 04:10:30,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:30,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:30,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:30,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:10:30,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:10:30,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:30,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:10:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:10:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:10:30,672 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-11-10 04:10:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:30,697 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-10 04:10:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:10:30,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 04:10:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:30,700 INFO L225 Difference]: With dead ends: 56 [2018-11-10 04:10:30,700 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 04:10:30,700 INFO L605 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-11-10 04:10:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 04:10:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-10 04:10:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 04:10:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-10 04:10:30,705 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2018-11-10 04:10:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:30,706 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-10 04:10:30,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:10:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-10 04:10:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 04:10:30,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:30,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:30,707 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:30,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510122, now seen corresponding path program 1 times [2018-11-10 04:10:30,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:30,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:10:30,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:10:30,796 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:30,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:10:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:10:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:10:30,797 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 7 states. [2018-11-10 04:10:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:30,879 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-10 04:10:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:10:30,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-10 04:10:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:30,879 INFO L225 Difference]: With dead ends: 50 [2018-11-10 04:10:30,880 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 04:10:30,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:10:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 04:10:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-10 04:10:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 04:10:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-10 04:10:30,883 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2018-11-10 04:10:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:30,883 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-10 04:10:30,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:10:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-10 04:10:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 04:10:30,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:30,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:30,884 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:30,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash 646271685, now seen corresponding path program 1 times [2018-11-10 04:10:30,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:30,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:10:30,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:10:30,982 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:30,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:10:30,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:10:30,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:10:30,983 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2018-11-10 04:10:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:31,075 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-10 04:10:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:10:31,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-10 04:10:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:31,075 INFO L225 Difference]: With dead ends: 49 [2018-11-10 04:10:31,076 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 04:10:31,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:10:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 04:10:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-10 04:10:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 04:10:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-10 04:10:31,080 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-11-10 04:10:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:31,080 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-10 04:10:31,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:10:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-10 04:10:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 04:10:31,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:31,080 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:31,080 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:31,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:31,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1750858933, now seen corresponding path program 1 times [2018-11-10 04:10:31,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:31,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:31,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:31,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:31,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:31,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:10:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:10:31,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:31,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:10:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:10:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:10:31,145 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2018-11-10 04:10:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:31,190 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-10 04:10:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:10:31,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 04:10:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:31,191 INFO L225 Difference]: With dead ends: 52 [2018-11-10 04:10:31,191 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 04:10:31,191 INFO L605 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-11-10 04:10:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 04:10:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-10 04:10:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 04:10:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-10 04:10:31,195 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 17 [2018-11-10 04:10:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:31,195 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-10 04:10:31,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:10:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-10 04:10:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 04:10:31,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:31,196 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:31,196 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:31,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash -361022790, now seen corresponding path program 1 times [2018-11-10 04:10:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:31,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:31,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:31,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:31,260 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:31,261 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 04:10:31,263 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [15], [17], [19], [28], [32], [37], [77], [78], [79], [81] [2018-11-10 04:10:31,293 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:10:31,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:10:31,693 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:10:31,694 INFO L272 AbstractInterpreter]: Visited 17 different actions 68 times. Merged at 6 different actions 44 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 04:10:31,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:31,700 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:10:31,776 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 80.7% of their original sizes. [2018-11-10 04:10:31,776 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:10:31,884 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 04:10:31,885 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:10:31,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:10:31,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2018-11-10 04:10:31,885 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:31,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 04:10:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:10:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:10:31,886 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-11-10 04:10:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:32,240 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-11-10 04:10:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:10:32,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-10 04:10:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:32,241 INFO L225 Difference]: With dead ends: 83 [2018-11-10 04:10:32,241 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 04:10:32,241 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:10:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 04:10:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2018-11-10 04:10:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 04:10:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-10 04:10:32,245 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 19 [2018-11-10 04:10:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:32,245 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-10 04:10:32,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 04:10:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-10 04:10:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:10:32,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:32,246 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:32,247 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:32,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1841873058, now seen corresponding path program 1 times [2018-11-10 04:10:32,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:32,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:32,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:32,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:32,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:32,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 04:10:32,322 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [40], [77], [78], [79], [81], [82] [2018-11-10 04:10:32,324 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:10:32,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:10:32,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 04:10:32,518 INFO L272 AbstractInterpreter]: Visited 22 different actions 95 times. Merged at 6 different actions 62 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-10 04:10:32,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:32,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 04:10:32,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:32,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:32,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:32,533 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 04:10:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:32,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:32,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:32,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 04:10:32,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-10 04:10:32,692 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 04:10:32,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:10:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:10:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:10:32,693 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 8 states. [2018-11-10 04:10:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:32,805 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-10 04:10:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:10:32,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-10 04:10:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:32,806 INFO L225 Difference]: With dead ends: 85 [2018-11-10 04:10:32,806 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 04:10:32,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:10:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 04:10:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-11-10 04:10:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 04:10:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-10 04:10:32,811 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 23 [2018-11-10 04:10:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:32,811 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-10 04:10:32,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:10:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-10 04:10:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 04:10:32,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:32,812 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:32,813 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:32,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash 216654009, now seen corresponding path program 2 times [2018-11-10 04:10:32,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:32,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:32,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:32,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:32,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:32,913 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 04:10:32,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 04:10:32,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:32,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:10:32,930 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 04:10:32,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 04:10:32,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:10:32,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:32,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 04:10:32,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 04:10:32,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:32,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:32,976 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-11-10 04:10:32,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-11-10 04:10:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 04:10:33,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 04:10:33,049 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:10:33,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [6] total 9 [2018-11-10 04:10:33,050 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:33,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:10:33,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:10:33,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:10:33,051 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2018-11-10 04:10:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:33,083 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-10 04:10:33,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:10:33,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-10 04:10:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:33,084 INFO L225 Difference]: With dead ends: 70 [2018-11-10 04:10:33,084 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 04:10:33,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:10:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 04:10:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-10 04:10:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 04:10:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-10 04:10:33,088 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 29 [2018-11-10 04:10:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:33,089 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-10 04:10:33,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:10:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-10 04:10:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:10:33,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:33,089 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:33,090 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:33,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1873660240, now seen corresponding path program 1 times [2018-11-10 04:10:33,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:33,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:10:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:33,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:33,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:33,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:33,181 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-10 04:10:33,182 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [42], [77], [78], [79], [81], [82] [2018-11-10 04:10:33,183 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:10:33,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:10:33,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 04:10:33,351 INFO L272 AbstractInterpreter]: Visited 23 different actions 96 times. Merged at 6 different actions 62 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-10 04:10:33,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:33,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 04:10:33,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:33,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:33,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:33,378 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 04:10:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:33,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:33,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:33,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 04:10:33,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-11-10 04:10:33,498 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 04:10:33,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 04:10:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:10:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:10:33,499 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 10 states. [2018-11-10 04:10:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:33,593 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-10 04:10:33,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:10:33,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-10 04:10:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:33,594 INFO L225 Difference]: With dead ends: 96 [2018-11-10 04:10:33,594 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 04:10:33,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-11-10 04:10:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 04:10:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-11-10 04:10:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 04:10:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-10 04:10:33,600 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 30 [2018-11-10 04:10:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:33,600 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-10 04:10:33,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 04:10:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-10 04:10:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:10:33,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:33,602 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:33,602 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:33,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:33,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1424498361, now seen corresponding path program 2 times [2018-11-10 04:10:33,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:33,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:33,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:33,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:33,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:33,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:33,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:33,710 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 04:10:33,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 04:10:33,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:33,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:33,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:10:33,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 04:10:33,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 04:10:33,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:10:33,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:33,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 04:10:33,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:33,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 04:10:33,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 04:10:33,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:33,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:33,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:33,767 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-11-10 04:10:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 04:10:33,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 04:10:33,881 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:10:33,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 14 [2018-11-10 04:10:33,881 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:33,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:10:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:10:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:10:33,881 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states. [2018-11-10 04:10:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:33,938 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-10 04:10:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:10:33,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-10 04:10:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:33,939 INFO L225 Difference]: With dead ends: 81 [2018-11-10 04:10:33,939 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 04:10:33,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-10 04:10:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 04:10:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-10 04:10:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 04:10:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-10 04:10:33,943 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 36 [2018-11-10 04:10:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:33,943 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-10 04:10:33,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:10:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-10 04:10:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:10:33,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:33,944 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:33,944 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:33,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 940344667, now seen corresponding path program 1 times [2018-11-10 04:10:33,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:33,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:33,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:10:33,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:33,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 04:10:33,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:10:33,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:10:33,984 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:33,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:10:33,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:10:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:10:33,984 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 6 states. [2018-11-10 04:10:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:34,032 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-10 04:10:34,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:10:34,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-10 04:10:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:34,033 INFO L225 Difference]: With dead ends: 80 [2018-11-10 04:10:34,033 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 04:10:34,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:10:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 04:10:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-10 04:10:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 04:10:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-10 04:10:34,036 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 43 [2018-11-10 04:10:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:34,036 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-10 04:10:34,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:10:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-10 04:10:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 04:10:34,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:34,037 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:34,037 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:34,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash -914086303, now seen corresponding path program 1 times [2018-11-10 04:10:34,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:34,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:34,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 04:10:34,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:34,078 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:34,078 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-10 04:10:34,078 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [61], [77], [78], [79], [81], [82] [2018-11-10 04:10:34,080 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:10:34,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:10:36,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 04:10:36,355 INFO L272 AbstractInterpreter]: Visited 30 different actions 1026 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 33 variables. [2018-11-10 04:10:36,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:36,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 04:10:36,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:36,365 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:36,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:36,375 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 04:10:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:36,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:36,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:10:36,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 04:10:36,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2018-11-10 04:10:36,543 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 04:10:36,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:10:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:10:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:10:36,544 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 9 states. [2018-11-10 04:10:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:36,595 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-11-10 04:10:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:10:36,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-10 04:10:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:36,596 INFO L225 Difference]: With dead ends: 135 [2018-11-10 04:10:36,596 INFO L226 Difference]: Without dead ends: 129 [2018-11-10 04:10:36,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:10:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-10 04:10:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2018-11-10 04:10:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 04:10:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-11-10 04:10:36,601 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 44 [2018-11-10 04:10:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:36,601 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-11-10 04:10:36,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:10:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-11-10 04:10:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 04:10:36,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:36,602 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:36,602 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:36,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:36,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1220773474, now seen corresponding path program 1 times [2018-11-10 04:10:36,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:36,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:36,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 44 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 04:10:36,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:36,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:36,723 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 04:10:36,723 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-11-10 04:10:36,725 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:10:36,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:10:38,209 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:10:38,210 INFO L272 AbstractInterpreter]: Visited 25 different actions 1130 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 30 variables. [2018-11-10 04:10:38,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:38,217 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:10:38,311 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 70.48% of their original sizes. [2018-11-10 04:10:38,312 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:10:38,524 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 04:10:38,525 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:10:38,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:10:38,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [8] total 25 [2018-11-10 04:10:38,525 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:38,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 04:10:38,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 04:10:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-10 04:10:38,526 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 19 states. [2018-11-10 04:10:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:39,322 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-10 04:10:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 04:10:39,322 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-10 04:10:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:39,323 INFO L225 Difference]: With dead ends: 102 [2018-11-10 04:10:39,323 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 04:10:39,324 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-11-10 04:10:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 04:10:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-10 04:10:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 04:10:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-11-10 04:10:39,327 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 56 [2018-11-10 04:10:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:39,327 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-11-10 04:10:39,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 04:10:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-11-10 04:10:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:10:39,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:39,331 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:39,331 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:39,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1005236038, now seen corresponding path program 2 times [2018-11-10 04:10:39,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:39,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:39,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-10 04:10:39,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:39,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:39,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 04:10:39,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 04:10:39,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:39,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:10:39,431 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 04:10:39,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 04:10:39,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:10:39,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:39,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 04:10:39,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:39,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 04:10:39,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 04:10:39,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:39,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:39,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:39,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-10 04:10:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-11-10 04:10:39,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-11-10 04:10:39,759 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:10:39,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 12 [2018-11-10 04:10:39,759 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:39,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:10:39,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:10:39,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:10:39,760 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 6 states. [2018-11-10 04:10:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:39,839 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-10 04:10:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:10:39,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-10 04:10:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:39,840 INFO L225 Difference]: With dead ends: 101 [2018-11-10 04:10:39,840 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 04:10:39,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-10 04:10:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 04:10:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-10 04:10:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 04:10:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-10 04:10:39,843 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 87 [2018-11-10 04:10:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:39,843 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-10 04:10:39,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:10:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-10 04:10:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 04:10:39,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:39,845 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:39,845 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:39,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1820052541, now seen corresponding path program 1 times [2018-11-10 04:10:39,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:39,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:10:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:39,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-10 04:10:39,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:39,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:39,898 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-11-10 04:10:39,898 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [62], [65], [67], [76], [77], [78], [79], [81], [82] [2018-11-10 04:10:39,899 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:10:39,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:10:42,138 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 04:10:42,138 INFO L272 AbstractInterpreter]: Visited 33 different actions 1029 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 39 variables. [2018-11-10 04:10:42,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:42,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 04:10:42,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:42,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/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-11-10 04:10:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:42,157 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 04:10:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:42,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 123 proven. 44 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 04:10:42,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 5 proven. 161 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 04:10:42,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 04:10:42,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2018-11-10 04:10:42,355 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 04:10:42,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 04:10:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:10:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-11-10 04:10:42,356 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 11 states. [2018-11-10 04:10:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:42,434 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-11-10 04:10:42,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 04:10:42,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-11-10 04:10:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:42,436 INFO L225 Difference]: With dead ends: 158 [2018-11-10 04:10:42,436 INFO L226 Difference]: Without dead ends: 152 [2018-11-10 04:10:42,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-11-10 04:10:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-10 04:10:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2018-11-10 04:10:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 04:10:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-11-10 04:10:42,439 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 90 [2018-11-10 04:10:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:42,439 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-11-10 04:10:42,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 04:10:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-11-10 04:10:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 04:10:42,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:10:42,444 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:10:42,444 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 04:10:42,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:10:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1515618710, now seen corresponding path program 2 times [2018-11-10 04:10:42,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:10:42,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:42,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:10:42,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:10:42,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:10:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:10:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2018-11-10 04:10:42,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:42,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:10:42,512 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 04:10:42,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 04:10:42,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:10:42,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:10:42,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:10:42,519 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 04:10:42,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 04:10:42,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:10:42,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:10:42,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:10:42,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 04:10:42,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 04:10:42,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:42,578 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-11-10 04:10:42,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 04:10:42,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:10:42,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 04:10:42,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 04:10:42,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:42,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:42,631 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-11-10 04:10:42,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 04:10:42,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:10:42,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 04:10:42,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 04:10:42,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:10:42,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:10:42,682 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-11-10 04:10:42,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 04:10:42,711 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int) (|v_main_~#b~0.base_12| Int)) (let ((.cse0 (store |c_old(#valid)| |v_main_~#b~0.base_12| 1))) (and (= |c_#valid| (store (store (store .cse0 main_ULTIMATE.dealloc_~addr.base 1) |v_main_~#b~0.base_12| 0) main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select .cse0 main_ULTIMATE.dealloc_~addr.base)) (= 0 (select |c_old(#valid)| |v_main_~#b~0.base_12|))))) is different from true [2018-11-10 04:10:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-11-10 04:10:42,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:10:42,789 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#Ultimate.alloc_#res.base_6| Int) (|v_main_~#b~0.base_14| Int)) (let ((.cse0 (store |c_#valid| |v_main_~#b~0.base_14| 1))) (or (not (= (select .cse0 |v_main_#Ultimate.alloc_#res.base_6|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#Ultimate.alloc_#res.base_6| 1) |v_main_~#b~0.base_14| 0) |v_main_#Ultimate.alloc_#res.base_6| 0)) (not (= 0 (select |c_#valid| |v_main_~#b~0.base_14|)))))) is different from false [2018-11-10 04:10:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-11-10 04:10:42,831 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:10:42,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 12 [2018-11-10 04:10:42,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:10:42,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:10:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:10:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=67, Unknown=2, NotChecked=34, Total=132 [2018-11-10 04:10:42,833 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 6 states. [2018-11-10 04:10:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:10:42,893 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-11-10 04:10:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:10:42,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-11-10 04:10:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:10:42,894 INFO L225 Difference]: With dead ends: 126 [2018-11-10 04:10:42,894 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:10:42,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 280 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=102, Unknown=2, NotChecked=42, Total=182 [2018-11-10 04:10:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:10:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:10:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:10:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:10:42,895 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-11-10 04:10:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:10:42,895 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:10:42,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:10:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:10:42,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:10:42,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:10:42 BoogieIcfgContainer [2018-11-10 04:10:42,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:10:42,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:10:42,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:10:42,900 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:10:42,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:10:30" (3/4) ... [2018-11-10 04:10:42,903 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:10:42,906 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:10:42,906 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-10 04:10:42,907 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:10:42,910 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2018-11-10 04:10:42,910 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-10 04:10:42,910 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 04:10:42,941 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c7307e6f-94a9-46a3-b956-615bc804f3ae/bin-2019/utaipan/witness.graphml [2018-11-10 04:10:42,941 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:10:42,942 INFO L168 Benchmark]: Toolchain (without parser) took 13049.25 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 959.2 MB in the beginning and 927.8 MB in the end (delta: 31.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-10 04:10:42,943 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:10:42,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:10:42,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.82 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:10:42,944 INFO L168 Benchmark]: Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:10:42,944 INFO L168 Benchmark]: RCFGBuilder took 250.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:10:42,944 INFO L168 Benchmark]: TraceAbstraction took 12568.64 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 156.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-10 04:10:42,945 INFO L168 Benchmark]: Witness Printer took 41.76 ms. Allocated memory is still 2.3 GB. Free memory was 956.1 MB in the beginning and 927.8 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:10:42,947 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.82 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 250.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12568.64 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 156.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 41.76 ms. Allocated memory is still 2.3 GB. Free memory was 956.1 MB in the beginning and 927.8 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 8 error locations. SAFE Result, 12.5s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 549 SDtfs, 700 SDslu, 1694 SDs, 0 SdLazy, 758 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1146 GetRequests, 960 SyntacticMatches, 14 SemanticMatches, 172 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.8s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.9403523922970023 AbsIntWeakeningRatio, 1.452054794520548 AbsIntAvgWeakeningVarsNumRemoved, 162.3835616438356 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 130 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1619 ConstructedInterpolants, 233 QuantifiedInterpolants, 727582 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1095 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 33 InterpolantComputations, 15 PerfectInterpolantSequences, 3514/3933 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...