./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.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_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 440325a953e10d2173456ab8f8c8fc1313a6b958 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:59:12,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:59:12,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:59:12,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:59:12,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:59:12,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:59:12,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:59:12,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:59:12,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:59:12,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:59:12,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:59:12,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:59:12,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:59:12,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:59:12,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:59:12,100 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:59:12,101 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:59:12,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:59:12,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:59:12,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:59:12,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:59:12,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:59:12,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:59:12,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:59:12,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:59:12,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:59:12,110 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:59:12,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:59:12,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:59:12,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:59:12,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:59:12,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:59:12,114 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:59:12,114 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:59:12,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:59:12,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:59:12,116 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 05:59:12,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:59:12,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:59:12,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:59:12,128 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:59:12,128 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:59:12,128 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:59:12,129 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:59:12,129 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:59:12,129 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:59:12,129 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:59:12,129 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:59:12,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:59:12,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:59:12,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:59:12,130 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:59:12,130 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:59:12,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:59:12,130 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:59:12,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:59:12,131 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 05:59:12,133 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 05:59:12,133 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 05:59:12,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:59:12,133 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:59:12,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:59:12,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:59:12,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:59:12,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:59:12,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:59:12,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:59:12,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:59:12,134 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:59:12,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:59:12,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:59:12,135 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_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2018-11-10 05:59:12,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:59:12,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:59:12,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:59:12,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:59:12,172 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:59:12,172 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-11-10 05:59:12,215 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/data/8c9e92c77/bb85759905614b9f8f0a147ff77c5255/FLAGd36294059 [2018-11-10 05:59:12,625 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:59:12,625 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-11-10 05:59:12,631 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/data/8c9e92c77/bb85759905614b9f8f0a147ff77c5255/FLAGd36294059 [2018-11-10 05:59:12,642 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/data/8c9e92c77/bb85759905614b9f8f0a147ff77c5255 [2018-11-10 05:59:12,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:59:12,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:59:12,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:59:12,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:59:12,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:59:12,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c7d5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12, skipping insertion in model container [2018-11-10 05:59:12,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:59:12,673 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:59:12,783 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:59:12,793 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:59:12,805 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:59:12,817 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:59:12,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12 WrapperNode [2018-11-10 05:59:12,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:59:12,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:59:12,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:59:12,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:59:12,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:59:12,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:59:12,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:59:12,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:59:12,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... [2018-11-10 05:59:12,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:59:12,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:59:12,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:59:12,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:59:12,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-11-10 05:59:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-11-10 05:59:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:59:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:59:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:59:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:59:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-11-10 05:59:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-11-10 05:59:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-10 05:59:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-10 05:59:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:59:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:59:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-10 05:59:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-10 05:59:13,415 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:59:13,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:59:13 BoogieIcfgContainer [2018-11-10 05:59:13,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:59:13,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:59:13,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:59:13,418 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:59:13,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:59:12" (1/3) ... [2018-11-10 05:59:13,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351cc6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:59:13, skipping insertion in model container [2018-11-10 05:59:13,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:12" (2/3) ... [2018-11-10 05:59:13,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351cc6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:59:13, skipping insertion in model container [2018-11-10 05:59:13,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:59:13" (3/3) ... [2018-11-10 05:59:13,421 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2018-11-10 05:59:13,427 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:59:13,435 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-10 05:59:13,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-10 05:59:13,462 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:59:13,462 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 05:59:13,462 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:59:13,462 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:59:13,462 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:59:13,462 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:59:13,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:59:13,463 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:59:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-11-10 05:59:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 05:59:13,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:13,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:13,483 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:13,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:13,487 INFO L82 PathProgramCache]: Analyzing trace with hash -122610617, now seen corresponding path program 1 times [2018-11-10 05:59:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:13,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:13,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:13,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:13,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:13,655 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 05:59:13,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:59:13,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:59:13,657 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:13,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:59:13,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:59:13,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:59:13,669 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-11-10 05:59:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:13,796 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-10 05:59:13,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:59:13,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 05:59:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:13,806 INFO L225 Difference]: With dead ends: 83 [2018-11-10 05:59:13,806 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 05:59:13,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:59:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 05:59:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-11-10 05:59:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 05:59:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-10 05:59:13,835 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 13 [2018-11-10 05:59:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:13,835 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-10 05:59:13,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:59:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-10 05:59:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 05:59:13,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:13,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:13,837 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:13,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 494038318, now seen corresponding path program 1 times [2018-11-10 05:59:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:13,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:13,979 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 05:59:13,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:59:13,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:59:13,980 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:13,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:59:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:59:13,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:59:13,982 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 5 states. [2018-11-10 05:59:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:14,173 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-10 05:59:14,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:59:14,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 05:59:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:14,175 INFO L225 Difference]: With dead ends: 85 [2018-11-10 05:59:14,175 INFO L226 Difference]: Without dead ends: 85 [2018-11-10 05:59:14,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:59:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-10 05:59:14,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-11-10 05:59:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 05:59:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-11-10 05:59:14,182 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 14 [2018-11-10 05:59:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:14,183 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-10 05:59:14,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:59:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-11-10 05:59:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 05:59:14,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:14,184 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:14,184 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:14,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash -786803888, now seen corresponding path program 1 times [2018-11-10 05:59:14,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:14,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:14,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:14,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:14,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:14,303 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:14,304 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 05:59:14,306 INFO L202 CegarAbsIntRunner]: [0], [1], [106], [110], [115], [117], [118], [119], [121], [127], [129], [131], [133], [134], [135], [137] [2018-11-10 05:59:14,341 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:14,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:14,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:14,968 INFO L272 AbstractInterpreter]: Visited 16 different actions 64 times. Merged at 6 different actions 48 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-10 05:59:14,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:14,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:14,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:14,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:14,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:14,989 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:15,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:15,065 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 15 treesize of output 18 [2018-11-10 05:59:15,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 30 [2018-11-10 05:59:15,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-11-10 05:59:15,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 37 [2018-11-10 05:59:15,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 05:59:15,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:59:15,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:59:15,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:59:15,239 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 26 treesize of output 25 [2018-11-10 05:59:15,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,253 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 2 case distinctions, treesize of input 22 treesize of output 38 [2018-11-10 05:59:15,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 05:59:15,297 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:15,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 05:59:15,319 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:15,330 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:15,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:15,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-10 05:59:15,358 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:68 [2018-11-10 05:59:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:15,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:15,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:15,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2018-11-10 05:59:15,783 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:15,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:59:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:59:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:59:15,784 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 11 states. [2018-11-10 05:59:17,594 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-11-10 05:59:20,324 WARN L179 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-10 05:59:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:20,416 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-11-10 05:59:20,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:59:20,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-10 05:59:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:20,418 INFO L225 Difference]: With dead ends: 89 [2018-11-10 05:59:20,418 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 05:59:20,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:59:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 05:59:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2018-11-10 05:59:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 05:59:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-10 05:59:20,424 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 19 [2018-11-10 05:59:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:20,424 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-10 05:59:20,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:59:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-10 05:59:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 05:59:20,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:20,425 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:20,426 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:20,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1273936261, now seen corresponding path program 1 times [2018-11-10 05:59:20,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:59:20,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:20,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:20,485 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-10 05:59:20,485 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [39], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-11-10 05:59:20,488 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:20,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:20,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:20,780 INFO L272 AbstractInterpreter]: Visited 23 different actions 71 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-10 05:59:20,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:20,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:20,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:20,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:20,804 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:20,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:20,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:20,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:20,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2018-11-10 05:59:20,906 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:20,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:59:20,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:59:20,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:59:20,907 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 11 states. [2018-11-10 05:59:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:21,224 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-11-10 05:59:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:59:21,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-10 05:59:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:21,225 INFO L225 Difference]: With dead ends: 93 [2018-11-10 05:59:21,225 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 05:59:21,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-10 05:59:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 05:59:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-11-10 05:59:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 05:59:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-10 05:59:21,231 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 29 [2018-11-10 05:59:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:21,232 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-10 05:59:21,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:59:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-10 05:59:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 05:59:21,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:21,233 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:21,233 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:21,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1480398001, now seen corresponding path program 1 times [2018-11-10 05:59:21,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:21,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:21,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:21,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:21,234 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:21,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:21,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:21,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-10 05:59:21,308 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [40], [41], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-11-10 05:59:21,310 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:21,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:21,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:21,559 INFO L272 AbstractInterpreter]: Visited 24 different actions 72 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-10 05:59:21,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:21,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:21,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:21,568 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:21,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:21,576 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:21,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:21,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:21,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:21,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-10 05:59:21,687 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:21,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:59:21,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:59:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:59:21,688 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 7 states. [2018-11-10 05:59:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:21,701 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-10 05:59:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:59:21,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-10 05:59:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:21,702 INFO L225 Difference]: With dead ends: 93 [2018-11-10 05:59:21,702 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 05:59:21,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:59:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 05:59:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-11-10 05:59:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 05:59:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-11-10 05:59:21,707 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 35 [2018-11-10 05:59:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:21,707 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-10 05:59:21,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:59:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-10 05:59:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 05:59:21,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:21,708 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:21,709 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:21,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1779855763, now seen corresponding path program 2 times [2018-11-10 05:59:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:21,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:21,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:21,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:21,756 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:21,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:21,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:21,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:21,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:21,763 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:21,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 05:59:21,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:21,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:21,788 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 43 treesize of output 39 [2018-11-10 05:59:21,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,818 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 2 case distinctions, treesize of input 36 treesize of output 49 [2018-11-10 05:59:21,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-11-10 05:59:21,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,878 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-11-10 05:59:21,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:21,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:21,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 57 [2018-11-10 05:59:21,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-10 05:59:21,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:21,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:21,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2018-11-10 05:59:21,983 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:22,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:59:22,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:22,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:22,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 05:59:22,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:22,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 30 [2018-11-10 05:59:22,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-11-10 05:59:22,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 51 [2018-11-10 05:59:22,037 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:22,046 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:22,052 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:22,057 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:22,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 05:59:22,069 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:61, output treesize:23 [2018-11-10 05:59:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:59:22,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:22,306 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 05:59:22,385 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 05:59:22,454 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 05:59:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:59:22,565 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:59:22,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-11-10 05:59:22,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:22,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:59:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:59:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:59:22,567 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 7 states. [2018-11-10 05:59:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:22,863 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-11-10 05:59:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:59:22,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-10 05:59:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:22,864 INFO L225 Difference]: With dead ends: 94 [2018-11-10 05:59:22,864 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 05:59:22,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:59:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 05:59:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-11-10 05:59:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 05:59:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-10 05:59:22,867 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 40 [2018-11-10 05:59:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:22,868 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-10 05:59:22,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:59:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-10 05:59:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 05:59:22,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:22,868 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:22,868 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:22,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash 659046269, now seen corresponding path program 1 times [2018-11-10 05:59:22,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:22,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:22,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:22,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:22,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:22,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:22,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:22,932 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-10 05:59:22,932 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [40], [42], [43], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-11-10 05:59:22,934 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:22,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:23,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:23,179 INFO L272 AbstractInterpreter]: Visited 25 different actions 73 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 41 variables. [2018-11-10 05:59:23,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:23,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:23,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:23,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:23,191 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:23,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:23,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:23,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:23,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-10 05:59:23,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:23,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:59:23,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:59:23,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:23,299 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 8 states. [2018-11-10 05:59:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:23,311 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-10 05:59:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:59:23,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-10 05:59:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:23,312 INFO L225 Difference]: With dead ends: 97 [2018-11-10 05:59:23,313 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 05:59:23,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 05:59:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-10 05:59:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 05:59:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-11-10 05:59:23,316 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 41 [2018-11-10 05:59:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:23,317 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-11-10 05:59:23,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:59:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-11-10 05:59:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 05:59:23,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:23,318 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:23,318 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:23,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:23,318 INFO L82 PathProgramCache]: Analyzing trace with hash 732140571, now seen corresponding path program 2 times [2018-11-10 05:59:23,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:23,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:23,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:23,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:23,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:23,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:23,373 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:23,373 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:23,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:23,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:23,373 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:23,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:23,379 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:23,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 05:59:23,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:23,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:23,402 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 18 treesize of output 21 [2018-11-10 05:59:23,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,417 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-11-10 05:59:23,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,428 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 2 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 05:59:23,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2018-11-10 05:59:23,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-11-10 05:59:23,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:23,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:23,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2018-11-10 05:59:23,469 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 05:59:23,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:23,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-10 05:59:23,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-10 05:59:23,525 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:23,530 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:23,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 05:59:23,584 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-10 05:59:23,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-10 05:59:23,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 05:59:23,592 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:23,596 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:23,600 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:23,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 05:59:23,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 05:59:23,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-11-10 05:59:23,673 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:18, output treesize:114 [2018-11-10 05:59:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 05:59:23,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 05:59:23,765 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:59:23,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 12 [2018-11-10 05:59:23,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:23,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:59:23,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:59:23,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:59:23,765 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 4 states. [2018-11-10 05:59:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:23,847 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-11-10 05:59:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:59:23,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-10 05:59:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:23,848 INFO L225 Difference]: With dead ends: 100 [2018-11-10 05:59:23,848 INFO L226 Difference]: Without dead ends: 100 [2018-11-10 05:59:23,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-10 05:59:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-11-10 05:59:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 05:59:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-10 05:59:23,852 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 46 [2018-11-10 05:59:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:23,853 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-10 05:59:23,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:59:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-10 05:59:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 05:59:23,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:23,854 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:23,854 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:23,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1221521297, now seen corresponding path program 1 times [2018-11-10 05:59:23,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:23,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:23,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:23,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:23,855 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:23,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:23,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:23,904 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 05:59:23,904 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [40], [42], [44], [45], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-11-10 05:59:23,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:23,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:24,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:24,127 INFO L272 AbstractInterpreter]: Visited 26 different actions 74 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 41 variables. [2018-11-10 05:59:24,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:24,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:24,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:24,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:24,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:24,133 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:24,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:24,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:24,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:24,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-10 05:59:24,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:24,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:59:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:59:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:24,245 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 9 states. [2018-11-10 05:59:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:24,257 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-10 05:59:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:59:24,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-10 05:59:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:24,258 INFO L225 Difference]: With dead ends: 101 [2018-11-10 05:59:24,258 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 05:59:24,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 05:59:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-10 05:59:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 05:59:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-11-10 05:59:24,261 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 47 [2018-11-10 05:59:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:24,261 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-11-10 05:59:24,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:59:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-10 05:59:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 05:59:24,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:24,262 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:24,263 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:24,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:24,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1905011281, now seen corresponding path program 2 times [2018-11-10 05:59:24,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:24,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:24,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:24,314 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:24,314 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:24,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:24,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:24,314 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/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 05:59:24,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:24,321 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:24,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 05:59:24,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:24,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:24,342 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 17 treesize of output 20 [2018-11-10 05:59:24,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,354 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-11-10 05:59:24,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,362 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 2 case distinctions, treesize of input 22 treesize of output 32 [2018-11-10 05:59:24,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-10 05:59:24,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 05:59:24,406 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,424 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-10 05:59:24,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 05:59:24,431 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,448 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 15 treesize of output 18 [2018-11-10 05:59:24,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-10 05:59:24,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2018-11-10 05:59:24,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:24,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-11-10 05:59:24,467 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-11-10 05:59:24,489 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,501 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:59:24,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-11-10 05:59:24,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-11-10 05:59:24,519 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,526 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:24,544 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:24,562 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:24,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 05:59:24,585 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:36, output treesize:34 [2018-11-10 05:59:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 05:59:24,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 05:59:24,800 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:59:24,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 17 [2018-11-10 05:59:24,800 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:24,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:59:24,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:59:24,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:59:24,801 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 6 states. [2018-11-10 05:59:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:25,046 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-10 05:59:25,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:59:25,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-11-10 05:59:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:25,047 INFO L225 Difference]: With dead ends: 101 [2018-11-10 05:59:25,047 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 05:59:25,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-11-10 05:59:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 05:59:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-10 05:59:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 05:59:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-10 05:59:25,050 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 52 [2018-11-10 05:59:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:25,050 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-10 05:59:25,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:59:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-10 05:59:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 05:59:25,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:25,052 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:25,052 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:25,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1490261631, now seen corresponding path program 1 times [2018-11-10 05:59:25,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:25,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:25,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:25,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:25,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:25,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:25,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:25,124 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 05:59:25,125 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [12], [13], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [133], [134], [135], [137] [2018-11-10 05:59:25,126 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:25,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:25,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:25,808 INFO L272 AbstractInterpreter]: Visited 35 different actions 147 times. Merged at 12 different actions 96 times. Widened at 2 different actions 8 times. Found 2 fixpoints after 2 different actions. Largest state had 44 variables. [2018-11-10 05:59:25,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:25,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:25,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:25,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:25,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:25,831 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:25,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:25,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:25,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:25,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-10 05:59:25,959 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:25,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 05:59:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:59:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:25,959 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 10 states. [2018-11-10 05:59:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:25,975 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-11-10 05:59:25,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:59:25,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-11-10 05:59:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:25,976 INFO L225 Difference]: With dead ends: 107 [2018-11-10 05:59:25,976 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 05:59:25,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 05:59:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-11-10 05:59:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 05:59:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-11-10 05:59:25,979 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 62 [2018-11-10 05:59:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:25,980 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-11-10 05:59:25,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 05:59:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-10 05:59:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 05:59:25,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:25,981 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:25,981 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:25,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1635173283, now seen corresponding path program 2 times [2018-11-10 05:59:25,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:25,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:25,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:25,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:25,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:26,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:26,056 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:26,056 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:26,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:26,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:26,056 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:26,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:26,070 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:26,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 05:59:26,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:26,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:26,096 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 36 treesize of output 35 [2018-11-10 05:59:26,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,134 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 38 [2018-11-10 05:59:26,137 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-10 05:59:26,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 45 [2018-11-10 05:59:26,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-11-10 05:59:26,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:26,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:26,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:26,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,213 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 2 case distinctions, treesize of input 34 treesize of output 41 [2018-11-10 05:59:26,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 56 [2018-11-10 05:59:26,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-11-10 05:59:26,276 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:26,287 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:26,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 62 [2018-11-10 05:59:26,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2018-11-10 05:59:26,330 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 05:59:26,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 58 [2018-11-10 05:59:26,371 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:26,400 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:26,435 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 05:59:26,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 05:59:26,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 05:59:26,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-11-10 05:59:26,553 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:174 [2018-11-10 05:59:26,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,781 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:26,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 63 [2018-11-10 05:59:26,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 05:59:26,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-10 05:59:26,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:26,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-10 05:59:26,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:71, output treesize:123 [2018-11-10 05:59:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 05:59:26,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 05:59:27,098 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:59:27,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 20 [2018-11-10 05:59:27,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:27,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:59:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:59:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:59:27,099 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 7 states. [2018-11-10 05:59:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:27,495 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-10 05:59:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:59:27,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-11-10 05:59:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:27,496 INFO L225 Difference]: With dead ends: 106 [2018-11-10 05:59:27,496 INFO L226 Difference]: Without dead ends: 106 [2018-11-10 05:59:27,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-11-10 05:59:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-10 05:59:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-11-10 05:59:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 05:59:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-10 05:59:27,499 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 67 [2018-11-10 05:59:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:27,499 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-10 05:59:27,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:59:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-10 05:59:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 05:59:27,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:27,500 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:27,501 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:27,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash -849235733, now seen corresponding path program 1 times [2018-11-10 05:59:27,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:27,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:27,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:27,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:27,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:27,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:27,606 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:27,606 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-10 05:59:27,606 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [12], [14], [15], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [133], [134], [135], [137] [2018-11-10 05:59:27,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:27,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:28,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:28,296 INFO L272 AbstractInterpreter]: Visited 36 different actions 148 times. Merged at 12 different actions 96 times. Widened at 2 different actions 8 times. Found 2 fixpoints after 2 different actions. Largest state had 44 variables. [2018-11-10 05:59:28,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:28,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:28,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:28,307 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:28,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:28,314 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:28,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:28,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:28,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-10 05:59:28,418 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:28,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:59:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:59:28,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:28,418 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 11 states. [2018-11-10 05:59:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:28,433 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-10 05:59:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:59:28,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-10 05:59:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:28,435 INFO L225 Difference]: With dead ends: 111 [2018-11-10 05:59:28,435 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 05:59:28,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 05:59:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-11-10 05:59:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 05:59:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-11-10 05:59:28,437 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 68 [2018-11-10 05:59:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:28,438 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-11-10 05:59:28,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:59:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-10 05:59:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 05:59:28,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:28,439 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:28,439 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:28,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 529820045, now seen corresponding path program 2 times [2018-11-10 05:59:28,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:28,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:28,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:28,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:28,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:28,517 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:28,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:28,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:28,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:28,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:28,528 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:28,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 05:59:28,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:28,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:28,562 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 17 treesize of output 20 [2018-11-10 05:59:28,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,601 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-11-10 05:59:28,604 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-10 05:59:28,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2018-11-10 05:59:28,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,648 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 2 case distinctions, treesize of input 22 treesize of output 32 [2018-11-10 05:59:28,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-10 05:59:28,682 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,702 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 05:59:28,704 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,714 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,731 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 15 treesize of output 18 [2018-11-10 05:59:28,735 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-10 05:59:28,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2018-11-10 05:59:28,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-11-10 05:59:28,758 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-11-10 05:59:28,780 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,792 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:59:28,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-11-10 05:59:28,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-11-10 05:59:28,809 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,816 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,835 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:28,854 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:28,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 05:59:28,880 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:36, output treesize:34 [2018-11-10 05:59:28,920 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 05:59:28,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,927 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 05:59:28,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-11-10 05:59:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 05:59:28,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:31,098 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 05:59:34,152 WARN L179 SmtUtils]: Spent 3.03 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-10 05:59:34,155 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-10 05:59:34,208 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 05:59:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 05:59:34,300 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:59:34,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 21 [2018-11-10 05:59:34,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:34,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:59:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:59:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=2, NotChecked=0, Total=420 [2018-11-10 05:59:34,301 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 7 states. [2018-11-10 05:59:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:34,489 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-10 05:59:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:59:34,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-11-10 05:59:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:34,490 INFO L225 Difference]: With dead ends: 112 [2018-11-10 05:59:34,490 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 05:59:34,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=103, Invalid=447, Unknown=2, NotChecked=0, Total=552 [2018-11-10 05:59:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 05:59:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-11-10 05:59:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 05:59:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-10 05:59:34,492 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 73 [2018-11-10 05:59:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:34,492 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-10 05:59:34,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:59:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-10 05:59:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 05:59:34,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:34,493 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:34,493 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:34,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash -755447741, now seen corresponding path program 1 times [2018-11-10 05:59:34,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:34,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:34,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 05:59:34,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:59:34,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:59:34,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:34,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:59:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:59:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:59:34,538 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 4 states. [2018-11-10 05:59:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:34,639 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-10 05:59:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:59:34,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-10 05:59:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:34,640 INFO L225 Difference]: With dead ends: 111 [2018-11-10 05:59:34,640 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 05:59:34,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:59:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 05:59:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-11-10 05:59:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 05:59:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2018-11-10 05:59:34,642 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 74 [2018-11-10 05:59:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:34,642 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2018-11-10 05:59:34,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:59:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-10 05:59:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 05:59:34,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:34,643 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:34,643 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:34,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1944043441, now seen corresponding path program 1 times [2018-11-10 05:59:34,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:34,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:34,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:34,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:34,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:34,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:34,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:34,721 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-11-10 05:59:34,721 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [12], [14], [16], [18], [19], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [133], [134], [135], [137] [2018-11-10 05:59:34,723 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:34,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:35,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:35,490 INFO L272 AbstractInterpreter]: Visited 38 different actions 150 times. Merged at 12 different actions 96 times. Widened at 2 different actions 8 times. Found 2 fixpoints after 2 different actions. Largest state had 48 variables. [2018-11-10 05:59:35,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:35,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:35,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:35,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:35,520 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:35,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:35,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:35,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:35,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-10 05:59:35,643 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:35,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:59:35,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:59:35,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:35,643 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 12 states. [2018-11-10 05:59:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:35,664 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-11-10 05:59:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:59:35,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-11-10 05:59:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:35,666 INFO L225 Difference]: With dead ends: 114 [2018-11-10 05:59:35,666 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 05:59:35,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 05:59:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-11-10 05:59:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 05:59:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-10 05:59:35,668 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 75 [2018-11-10 05:59:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:35,669 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-10 05:59:35,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:59:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-10 05:59:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 05:59:35,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:35,670 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:35,670 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:35,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870381, now seen corresponding path program 2 times [2018-11-10 05:59:35,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:35,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:35,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:59:35,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:35,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:35,731 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:35,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:35,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:35,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:35,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:35,740 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:35,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 05:59:35,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:35,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:35,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 05:59:35,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:35,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:35,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-11-10 05:59:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 05:59:35,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 05:59:35,894 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:59:35,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [12] total 18 [2018-11-10 05:59:35,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:59:35,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:59:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:59:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-10 05:59:35,895 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 5 states. [2018-11-10 05:59:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:35,993 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-11-10 05:59:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:59:35,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 05:59:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:35,994 INFO L225 Difference]: With dead ends: 114 [2018-11-10 05:59:35,994 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 05:59:35,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:59:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 05:59:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-10 05:59:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 05:59:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-11-10 05:59:35,998 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 80 [2018-11-10 05:59:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:35,998 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-11-10 05:59:35,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:59:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-11-10 05:59:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 05:59:35,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:35,999 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:35,999 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:35,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:35,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1627725795, now seen corresponding path program 1 times [2018-11-10 05:59:35,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:36,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:36,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:36,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:36,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:59:36,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:36,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:36,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-11-10 05:59:36,076 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [10], [12], [14], [16], [18], [20], [22], [26], [27], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [55], [59], [64], [65], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [132], [133], [134], [135], [137] [2018-11-10 05:59:36,078 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:59:36,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:59:37,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:59:37,397 INFO L272 AbstractInterpreter]: Visited 47 different actions 223 times. Merged at 19 different actions 152 times. Widened at 3 different actions 12 times. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2018-11-10 05:59:37,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:37,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:59:37,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:37,404 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:37,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:37,409 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:37,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:59:37,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:59:37,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:37,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-10 05:59:37,561 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:37,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:59:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:59:37,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:37,562 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 13 states. [2018-11-10 05:59:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:37,586 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-10 05:59:37,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:59:37,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-11-10 05:59:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:37,588 INFO L225 Difference]: With dead ends: 117 [2018-11-10 05:59:37,589 INFO L226 Difference]: Without dead ends: 117 [2018-11-10 05:59:37,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-10 05:59:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-10 05:59:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-10 05:59:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-10 05:59:37,591 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 90 [2018-11-10 05:59:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:37,591 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-10 05:59:37,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:59:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-10 05:59:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 05:59:37,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:37,592 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:37,592 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:37,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:37,593 INFO L82 PathProgramCache]: Analyzing trace with hash -113863873, now seen corresponding path program 2 times [2018-11-10 05:59:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:37,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:37,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:37,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:37,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:37,632 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:37,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:37,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:37,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:37,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:37,653 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:37,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 05:59:37,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:37,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:37,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:37,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:37,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-10 05:59:37,841 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:37,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:59:37,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:59:37,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:59:37,842 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 5 states. [2018-11-10 05:59:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:37,853 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-10 05:59:37,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:59:37,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-10 05:59:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:37,855 INFO L225 Difference]: With dead ends: 129 [2018-11-10 05:59:37,855 INFO L226 Difference]: Without dead ends: 129 [2018-11-10 05:59:37,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:59:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-10 05:59:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-11-10 05:59:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-10 05:59:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-11-10 05:59:37,858 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 95 [2018-11-10 05:59:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:37,858 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-11-10 05:59:37,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:59:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-11-10 05:59:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 05:59:37,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:37,859 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:37,862 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:37,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:37,862 INFO L82 PathProgramCache]: Analyzing trace with hash -166389338, now seen corresponding path program 3 times [2018-11-10 05:59:37,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:37,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:37,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:37,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:37,902 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:37,902 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:37,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:37,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:37,902 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:59:37,910 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 05:59:37,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:59:37,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:37,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:37,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:38,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:38,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-10 05:59:38,055 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:38,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:59:38,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:59:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:59:38,056 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 6 states. [2018-11-10 05:59:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:38,068 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-11-10 05:59:38,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:59:38,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-10 05:59:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:38,070 INFO L225 Difference]: With dead ends: 136 [2018-11-10 05:59:38,070 INFO L226 Difference]: Without dead ends: 136 [2018-11-10 05:59:38,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:59:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-10 05:59:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2018-11-10 05:59:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 05:59:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-10 05:59:38,073 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 102 [2018-11-10 05:59:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:38,073 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-10 05:59:38,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:59:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-10 05:59:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 05:59:38,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:38,074 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:38,074 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:38,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:38,074 INFO L82 PathProgramCache]: Analyzing trace with hash 210559327, now seen corresponding path program 4 times [2018-11-10 05:59:38,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:38,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:38,111 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:38,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:38,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:38,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:38,127 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:38,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:38,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-10 05:59:38,240 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:38,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:59:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:59:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:59:38,241 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 7 states. [2018-11-10 05:59:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:38,266 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-11-10 05:59:38,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:59:38,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-10 05:59:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:38,268 INFO L225 Difference]: With dead ends: 143 [2018-11-10 05:59:38,268 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 05:59:38,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:59:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 05:59:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2018-11-10 05:59:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-10 05:59:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2018-11-10 05:59:38,271 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 109 [2018-11-10 05:59:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:38,271 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2018-11-10 05:59:38,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:59:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-11-10 05:59:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 05:59:38,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:38,272 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:38,273 INFO L424 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:38,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash 768649094, now seen corresponding path program 5 times [2018-11-10 05:59:38,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:38,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:38,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 05:59:38,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:38,341 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:38,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:38,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:38,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:38,356 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:38,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 05:59:38,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:38,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-10 05:59:38,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-10 05:59:38,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:38,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-11-10 05:59:38,544 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:38,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:59:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:59:38,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:59:38,544 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand 9 states. [2018-11-10 05:59:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:38,581 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-11-10 05:59:38,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:59:38,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-11-10 05:59:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:38,584 INFO L225 Difference]: With dead ends: 162 [2018-11-10 05:59:38,584 INFO L226 Difference]: Without dead ends: 162 [2018-11-10 05:59:38,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:59:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-10 05:59:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-11-10 05:59:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 05:59:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-10 05:59:38,587 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 116 [2018-11-10 05:59:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:38,587 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-10 05:59:38,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:59:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-10 05:59:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 05:59:38,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:38,588 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:38,588 INFO L424 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:38,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:38,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2015781474, now seen corresponding path program 6 times [2018-11-10 05:59:38,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-10 05:59:38,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,642 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:38,642 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:38,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:38,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,642 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:59:38,653 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 05:59:38,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:59:38,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:38,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-10 05:59:38,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-10 05:59:38,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:38,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-10 05:59:38,775 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:38,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:59:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:59:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:38,776 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 9 states. [2018-11-10 05:59:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:38,801 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2018-11-10 05:59:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:59:38,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2018-11-10 05:59:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:38,803 INFO L225 Difference]: With dead ends: 164 [2018-11-10 05:59:38,803 INFO L226 Difference]: Without dead ends: 164 [2018-11-10 05:59:38,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-10 05:59:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2018-11-10 05:59:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 05:59:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2018-11-10 05:59:38,807 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 130 [2018-11-10 05:59:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:38,807 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2018-11-10 05:59:38,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:59:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-10 05:59:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 05:59:38,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:38,808 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:38,808 INFO L424 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:38,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash -886241833, now seen corresponding path program 7 times [2018-11-10 05:59:38,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:38,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:38,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:38,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-10 05:59:38,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:38,867 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:38,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:38,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:38,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:38,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:38,875 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:38,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-10 05:59:38,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-10 05:59:39,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-10 05:59:39,023 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:39,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 05:59:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:59:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:39,024 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 10 states. [2018-11-10 05:59:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:39,047 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-11-10 05:59:39,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:59:39,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-11-10 05:59:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:39,049 INFO L225 Difference]: With dead ends: 171 [2018-11-10 05:59:39,049 INFO L226 Difference]: Without dead ends: 171 [2018-11-10 05:59:39,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 267 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-10 05:59:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2018-11-10 05:59:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 05:59:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2018-11-10 05:59:39,052 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 137 [2018-11-10 05:59:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:39,052 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2018-11-10 05:59:39,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 05:59:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-11-10 05:59:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 05:59:39,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:39,053 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:39,053 INFO L424 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:39,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1339530110, now seen corresponding path program 8 times [2018-11-10 05:59:39,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:39,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:39,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-10 05:59:39,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:39,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:39,115 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:39,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:39,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:39,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:39,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:39,123 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:39,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 05:59:39,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:39,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-10 05:59:39,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-10 05:59:39,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:39,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 17 [2018-11-10 05:59:39,401 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:39,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:59:39,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:59:39,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:59:39,402 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 14 states. [2018-11-10 05:59:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:39,451 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2018-11-10 05:59:39,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:59:39,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-11-10 05:59:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:39,452 INFO L225 Difference]: With dead ends: 190 [2018-11-10 05:59:39,452 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 05:59:39,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:59:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 05:59:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2018-11-10 05:59:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-10 05:59:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2018-11-10 05:59:39,456 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 144 [2018-11-10 05:59:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:39,456 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2018-11-10 05:59:39,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:59:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2018-11-10 05:59:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:59:39,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:39,458 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:39,458 INFO L424 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:39,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1683255846, now seen corresponding path program 9 times [2018-11-10 05:59:39,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:39,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:39,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:39,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-10 05:59:39,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:39,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:39,581 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:39,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:39,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:39,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:39,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:59:39,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 05:59:39,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:59:39,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:39,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-10 05:59:39,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-10 05:59:39,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-10 05:59:39,794 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:39,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:59:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:59:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:39,795 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand 12 states. [2018-11-10 05:59:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:39,831 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2018-11-10 05:59:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:59:39,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-11-10 05:59:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:39,833 INFO L225 Difference]: With dead ends: 192 [2018-11-10 05:59:39,833 INFO L226 Difference]: Without dead ends: 192 [2018-11-10 05:59:39,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 307 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-10 05:59:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2018-11-10 05:59:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-10 05:59:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2018-11-10 05:59:39,836 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 158 [2018-11-10 05:59:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:39,837 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2018-11-10 05:59:39,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:59:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2018-11-10 05:59:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 05:59:39,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:39,838 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:39,838 INFO L424 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:39,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash -456803617, now seen corresponding path program 10 times [2018-11-10 05:59:39,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:39,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:39,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-10 05:59:39,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:39,946 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:39,946 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:39,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:39,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:39,946 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:39,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:39,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:40,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-10 05:59:40,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-10 05:59:40,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:40,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-10 05:59:40,238 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:40,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:59:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:59:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:40,239 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 13 states. [2018-11-10 05:59:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:40,268 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2018-11-10 05:59:40,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:59:40,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 165 [2018-11-10 05:59:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:40,269 INFO L225 Difference]: With dead ends: 194 [2018-11-10 05:59:40,269 INFO L226 Difference]: Without dead ends: 194 [2018-11-10 05:59:40,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 320 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-10 05:59:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-11-10 05:59:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-10 05:59:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-11-10 05:59:40,272 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 165 [2018-11-10 05:59:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:40,272 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-11-10 05:59:40,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:59:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-11-10 05:59:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 05:59:40,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:40,273 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:40,273 INFO L424 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:40,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1718820858, now seen corresponding path program 11 times [2018-11-10 05:59:40,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:40,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:40,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:40,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:40,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:40,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:40,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:40,353 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:40,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:40,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:40,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:40,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:40,365 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:41,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 05:59:41,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:41,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:41,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:41,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:41,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2018-11-10 05:59:41,383 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:41,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:59:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:59:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=82, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:41,384 INFO L87 Difference]: Start difference. First operand 194 states and 198 transitions. Second operand 9 states. [2018-11-10 05:59:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:41,463 INFO L93 Difference]: Finished difference Result 206 states and 210 transitions. [2018-11-10 05:59:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:59:41,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2018-11-10 05:59:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:41,465 INFO L225 Difference]: With dead ends: 206 [2018-11-10 05:59:41,465 INFO L226 Difference]: Without dead ends: 206 [2018-11-10 05:59:41,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=95, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:59:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-10 05:59:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2018-11-10 05:59:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 05:59:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2018-11-10 05:59:41,469 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 172 [2018-11-10 05:59:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:41,469 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2018-11-10 05:59:41,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:59:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2018-11-10 05:59:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:59:41,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:41,470 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:41,470 INFO L424 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:41,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1315331895, now seen corresponding path program 12 times [2018-11-10 05:59:41,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:41,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:41,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:41,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:41,577 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:41,577 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:41,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:41,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:41,577 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:41,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:59:41,587 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 05:59:42,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:59:42,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:42,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:42,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:42,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:42,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-10 05:59:42,114 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:42,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:59:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:59:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:42,114 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 8 states. [2018-11-10 05:59:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:42,136 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-11-10 05:59:42,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:59:42,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-11-10 05:59:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:42,137 INFO L225 Difference]: With dead ends: 213 [2018-11-10 05:59:42,137 INFO L226 Difference]: Without dead ends: 213 [2018-11-10 05:59:42,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-10 05:59:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2018-11-10 05:59:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-10 05:59:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 212 transitions. [2018-11-10 05:59:42,141 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 212 transitions. Word has length 179 [2018-11-10 05:59:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:42,142 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 212 transitions. [2018-11-10 05:59:42,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:59:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-11-10 05:59:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 05:59:42,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:42,143 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:42,143 INFO L424 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:42,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1161193754, now seen corresponding path program 13 times [2018-11-10 05:59:42,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:42,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:42,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:42,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:42,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:42,251 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:42,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:42,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:42,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:42,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:42,265 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:42,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:42,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:42,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:42,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-10 05:59:42,495 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:42,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:59:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:59:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:42,496 INFO L87 Difference]: Start difference. First operand 208 states and 212 transitions. Second operand 9 states. [2018-11-10 05:59:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:42,533 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2018-11-10 05:59:42,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:59:42,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-11-10 05:59:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:42,534 INFO L225 Difference]: With dead ends: 220 [2018-11-10 05:59:42,534 INFO L226 Difference]: Without dead ends: 220 [2018-11-10 05:59:42,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-10 05:59:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2018-11-10 05:59:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-10 05:59:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2018-11-10 05:59:42,538 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 186 [2018-11-10 05:59:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:42,539 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2018-11-10 05:59:42,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:59:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2018-11-10 05:59:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 05:59:42,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:42,540 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:42,540 INFO L424 AbstractCegarLoop]: === Iteration 31 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:42,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:42,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1936184233, now seen corresponding path program 14 times [2018-11-10 05:59:42,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:42,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:42,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:42,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:42,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:42,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:42,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:42,661 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:42,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:42,662 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:42,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:42,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:59:46,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 05:59:46,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:46,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 65 proven. 117 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2018-11-10 05:59:46,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:46,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:46,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 26 [2018-11-10 05:59:46,625 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:46,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 05:59:46,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 05:59:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2018-11-10 05:59:46,626 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 23 states. [2018-11-10 05:59:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:46,837 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-11-10 05:59:46,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:59:46,838 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 193 [2018-11-10 05:59:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:46,838 INFO L225 Difference]: With dead ends: 227 [2018-11-10 05:59:46,839 INFO L226 Difference]: Without dead ends: 227 [2018-11-10 05:59:46,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 366 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2018-11-10 05:59:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-10 05:59:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 222. [2018-11-10 05:59:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-10 05:59:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 226 transitions. [2018-11-10 05:59:46,842 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 226 transitions. Word has length 193 [2018-11-10 05:59:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:46,843 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 226 transitions. [2018-11-10 05:59:46,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 05:59:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2018-11-10 05:59:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 05:59:46,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:46,844 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:46,844 INFO L424 AbstractCegarLoop]: === Iteration 32 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:46,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1601387066, now seen corresponding path program 15 times [2018-11-10 05:59:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:46,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:46,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:46,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:46,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:46,940 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:46,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:46,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:46,941 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:46,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:59:46,951 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 05:59:47,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:59:47,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:47,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:47,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:47,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:47,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-10 05:59:47,212 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:47,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:59:47,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:59:47,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:47,213 INFO L87 Difference]: Start difference. First operand 222 states and 226 transitions. Second operand 11 states. [2018-11-10 05:59:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:47,247 INFO L93 Difference]: Finished difference Result 234 states and 238 transitions. [2018-11-10 05:59:47,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:59:47,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2018-11-10 05:59:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:47,249 INFO L225 Difference]: With dead ends: 234 [2018-11-10 05:59:47,249 INFO L226 Difference]: Without dead ends: 234 [2018-11-10 05:59:47,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 392 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-10 05:59:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2018-11-10 05:59:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-10 05:59:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2018-11-10 05:59:47,253 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 200 [2018-11-10 05:59:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:47,253 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2018-11-10 05:59:47,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:59:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2018-11-10 05:59:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 05:59:47,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:47,255 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:47,255 INFO L424 AbstractCegarLoop]: === Iteration 33 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:47,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1869840009, now seen corresponding path program 16 times [2018-11-10 05:59:47,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:47,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:47,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:47,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:47,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:47,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:47,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:47,341 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:47,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:47,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:47,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:47,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:47,349 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:59:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:47,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:47,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:59:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:47,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:59:47,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-10 05:59:47,548 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:59:47,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:59:47,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:59:47,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:47,549 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 12 states. [2018-11-10 05:59:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:47,576 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-11-10 05:59:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:59:47,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 207 [2018-11-10 05:59:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:59:47,577 INFO L225 Difference]: With dead ends: 241 [2018-11-10 05:59:47,577 INFO L226 Difference]: Without dead ends: 241 [2018-11-10 05:59:47,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 405 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:59:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-10 05:59:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 236. [2018-11-10 05:59:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-10 05:59:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 240 transitions. [2018-11-10 05:59:47,581 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 240 transitions. Word has length 207 [2018-11-10 05:59:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:59:47,581 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 240 transitions. [2018-11-10 05:59:47,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:59:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2018-11-10 05:59:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 05:59:47,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:59:47,583 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:47,583 INFO L424 AbstractCegarLoop]: === Iteration 34 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 05:59:47,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1037800282, now seen corresponding path program 17 times [2018-11-10 05:59:47,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:59:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:47,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:59:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 05:59:47,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:47,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:59:47,730 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:59:47,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:59:47,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:47,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:59:47,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:59:47,735 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:00:00,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 06:00:00,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:00:00,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:00:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 06:00:00,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:00:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 06:00:00,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:00:00,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 22 [2018-11-10 06:00:00,280 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:00:00,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 06:00:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 06:00:00,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-11-10 06:00:00,280 INFO L87 Difference]: Start difference. First operand 236 states and 240 transitions. Second operand 21 states. [2018-11-10 06:00:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:00,313 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-11-10 06:00:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 06:00:00,313 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 214 [2018-11-10 06:00:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:00,314 INFO L225 Difference]: With dead ends: 243 [2018-11-10 06:00:00,314 INFO L226 Difference]: Without dead ends: 243 [2018-11-10 06:00:00,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-11-10 06:00:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-10 06:00:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-11-10 06:00:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-10 06:00:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2018-11-10 06:00:00,318 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 214 [2018-11-10 06:00:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:00,318 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2018-11-10 06:00:00,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 06:00:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2018-11-10 06:00:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 06:00:00,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:00,319 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:00,320 INFO L424 AbstractCegarLoop]: === Iteration 35 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:00,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1355456873, now seen corresponding path program 18 times [2018-11-10 06:00:00,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:00,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:00:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:00,321 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:00:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:00:00,652 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 06:00:00,667 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,668 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,668 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,669 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,681 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,681 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,683 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,683 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,683 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,687 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,688 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,688 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,688 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,688 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,688 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,688 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,688 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,689 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,689 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,689 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,689 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,689 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,689 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,689 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,690 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,690 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,690 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,690 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,690 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,690 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,690 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,691 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,691 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,691 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,691 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,691 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,691 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,691 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,694 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,694 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,694 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,694 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,694 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,694 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,694 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,695 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,695 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,695 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,695 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,698 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,699 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,699 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,699 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,699 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,699 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,699 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,700 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,700 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,700 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,700 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,700 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,700 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,701 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,701 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,701 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,701 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,701 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,701 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,703 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,703 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,705 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,705 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,705 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,706 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,706 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,706 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,706 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,706 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,707 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,707 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,707 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,707 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,707 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,708 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,708 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,708 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,708 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,708 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,708 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,709 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,709 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,709 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,709 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,709 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,709 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,710 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,710 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,710 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,710 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,710 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,711 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,711 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,711 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,711 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,711 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,711 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,712 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,712 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,712 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,712 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,712 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,712 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,714 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,715 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,715 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,715 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,715 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:00:00 BoogieIcfgContainer [2018-11-10 06:00:00,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:00:00,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:00:00,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:00:00,756 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:00:00,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:59:13" (3/4) ... [2018-11-10 06:00:00,758 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 06:00:00,763 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,763 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,763 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,763 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,770 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,770 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,770 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,770 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,770 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,773 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,773 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,773 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,773 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,773 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,773 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,781 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,781 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,781 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,781 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,781 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,781 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,785 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,785 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,785 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,785 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,785 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,785 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,785 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,786 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,786 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,786 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,786 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,786 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,786 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,786 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,789 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,789 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,789 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,789 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,789 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,789 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,789 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,790 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,790 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,790 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,790 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,790 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,790 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,793 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,793 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,793 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 06:00:00,793 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,793 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:00:00,872 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85d19343-d0b2-4aed-b48d-47031c05b6c8/bin-2019/utaipan/witness.graphml [2018-11-10 06:00:00,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:00:00,873 INFO L168 Benchmark]: Toolchain (without parser) took 48228.17 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 954.4 MB in the beginning and 840.3 MB in the end (delta: 114.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 06:00:00,873 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:00:00,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.55 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:00:00,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.72 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:00:00,874 INFO L168 Benchmark]: Boogie Preprocessor took 66.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:00:00,874 INFO L168 Benchmark]: RCFGBuilder took 499.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:00:00,874 INFO L168 Benchmark]: TraceAbstraction took 47339.59 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 875.6 MB). Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 188.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 06:00:00,875 INFO L168 Benchmark]: Witness Printer took 116.39 ms. Allocated memory is still 2.0 GB. Free memory was 884.7 MB in the beginning and 840.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:00:00,879 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.55 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.72 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 499.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47339.59 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 875.6 MB). Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 188.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 116.39 ms. Allocated memory is still 2.0 GB. Free memory was 884.7 MB in the beginning and 840.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L48] CALL "%d\n" [L48] RET "%d\n" [L6] CALL static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L17] CALL static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L36] CALL static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L45] CALL getNumbers4() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L35] CALL, EXPR getNumbers3() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L25] CALL, EXPR getNumbers2() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L16] CALL, EXPR getNumbers() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L12] RET return array; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L16] EXPR getNumbers() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L21] RET return numbers2; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L25] EXPR getNumbers2() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L25] int* numbers = getNumbers2(); [L26] CALL int numbers3[10]; [L26] RET int numbers3[10]; [L27] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L31] return numbers3; [L31] RET return numbers3; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L35] EXPR getNumbers3() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L37] COND TRUE i < 10 [L38] CALL numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 17 error locations. UNSAFE Result, 47.2s OverallTime, 35 OverallIterations, 11 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2258 SDtfs, 1367 SDslu, 10774 SDs, 0 SdLazy, 2131 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6957 GetRequests, 6439 SyntacticMatches, 94 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.2s AbstIntTime, 9 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 154 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 18.9s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 6984 NumberOfCodeBlocks, 6432 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 9998 ConstructedInterpolants, 162 QuantifiedInterpolants, 2870470 SizeOfPredicates, 135 NumberOfNonLiveVariables, 14728 ConjunctsInSsa, 389 ConjunctsInUnsatCore, 96 InterpolantComputations, 15 PerfectInterpolantSequences, 21008/28877 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...