./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.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_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 9af739900018493f70ca6be86d814e194413d937 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:35:49,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:35:49,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:35:49,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:35:49,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:35:49,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:35:49,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:35:49,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:35:49,445 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:35:49,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:35:49,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:35:49,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:35:49,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:35:49,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:35:49,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:35:49,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:35:49,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:35:49,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:35:49,452 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:35:49,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:35:49,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:35:49,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:35:49,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:35:49,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:35:49,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:35:49,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:35:49,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:35:49,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:35:49,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:35:49,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:35:49,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:35:49,460 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:35:49,460 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:35:49,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:35:49,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:35:49,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:35:49,462 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 13:35:49,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:35:49,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:35:49,472 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:35:49,472 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:35:49,472 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:35:49,473 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:35:49,473 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:35:49,473 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:35:49,473 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:35:49,473 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:35:49,473 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:35:49,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:35:49,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:35:49,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:35:49,474 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:35:49,474 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:35:49,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:35:49,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:35:49,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:35:49,475 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 13:35:49,475 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 13:35:49,475 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 13:35:49,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:35:49,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:35:49,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:35:49,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:35:49,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:35:49,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:35:49,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:35:49,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:35:49,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:35:49,476 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:35:49,477 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:35:49,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:35:49,477 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_ef41455d-8f26-4931-91f0-23884d7bac76/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 -> 9af739900018493f70ca6be86d814e194413d937 [2018-11-10 13:35:49,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:35:49,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:35:49,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:35:49,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:35:49,513 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:35:49,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-11-10 13:35:49,560 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/data/b119adda6/f7bd95c8ddc34b83818e73b61c57c05c/FLAGf03d7d3a0 [2018-11-10 13:35:49,891 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:35:49,892 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-11-10 13:35:49,896 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/data/b119adda6/f7bd95c8ddc34b83818e73b61c57c05c/FLAGf03d7d3a0 [2018-11-10 13:35:49,905 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/data/b119adda6/f7bd95c8ddc34b83818e73b61c57c05c [2018-11-10 13:35:49,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:35:49,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:35:49,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:35:49,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:35:49,911 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:35:49,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:35:49" (1/1) ... [2018-11-10 13:35:49,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f2c233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:49, skipping insertion in model container [2018-11-10 13:35:49,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:35:49" (1/1) ... [2018-11-10 13:35:49,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:35:49,932 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:35:50,027 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:35:50,033 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:35:50,043 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:35:50,051 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:35:50,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50 WrapperNode [2018-11-10 13:35:50,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:35:50,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:35:50,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:35:50,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:35:50,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:35:50,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:35:50,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:35:50,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:35:50,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... [2018-11-10 13:35:50,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:35:50,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:35:50,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:35:50,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:35:50,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:35:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:35:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:35:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 13:35:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 13:35:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:35:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:35:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:35:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:35:50,362 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:35:50,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:35:50 BoogieIcfgContainer [2018-11-10 13:35:50,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:35:50,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:35:50,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:35:50,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:35:50,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:35:49" (1/3) ... [2018-11-10 13:35:50,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0d7aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:35:50, skipping insertion in model container [2018-11-10 13:35:50,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:35:50" (2/3) ... [2018-11-10 13:35:50,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0d7aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:35:50, skipping insertion in model container [2018-11-10 13:35:50,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:35:50" (3/3) ... [2018-11-10 13:35:50,369 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-11-10 13:35:50,378 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:35:50,384 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 13:35:50,398 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 13:35:50,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:35:50,421 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 13:35:50,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:35:50,421 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:35:50,421 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:35:50,422 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:35:50,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:35:50,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:35:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 13:35:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 13:35:50,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:50,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:50,445 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-11-10 13:35:50,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:50,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:50,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:35:50,551 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:50,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:35:50,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:35:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:35:50,564 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-10 13:35:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:50,575 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-10 13:35:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:35:50,576 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 13:35:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:50,584 INFO L225 Difference]: With dead ends: 44 [2018-11-10 13:35:50,584 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 13:35:50,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:35:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 13:35:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 13:35:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 13:35:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-10 13:35:50,606 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-11-10 13:35:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:50,607 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 13:35:50,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:35:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-10 13:35:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 13:35:50,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:50,608 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:50,608 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:50,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-11-10 13:35:50,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:50,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:50,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,610 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:50,646 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 13:35:50,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:50,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:35:50,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:50,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:35:50,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:35:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:35:50,648 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-11-10 13:35:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:50,681 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 13:35:50,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:35:50,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 13:35:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:50,683 INFO L225 Difference]: With dead ends: 61 [2018-11-10 13:35:50,684 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 13:35:50,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:35:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 13:35:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-11-10 13:35:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 13:35:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-10 13:35:50,692 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-11-10 13:35:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:50,692 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 13:35:50,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:35:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-10 13:35:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 13:35:50,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:50,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:50,693 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:50,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-11-10 13:35:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:50,774 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 13:35:50,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:50,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:35:50,774 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:50,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:35:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:35:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:35:50,775 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-11-10 13:35:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:50,892 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-11-10 13:35:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:35:50,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-10 13:35:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:50,895 INFO L225 Difference]: With dead ends: 93 [2018-11-10 13:35:50,895 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 13:35:50,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 13:35:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 62. [2018-11-10 13:35:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 13:35:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-10 13:35:50,901 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 13 [2018-11-10 13:35:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:50,901 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 13:35:50,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:35:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-10 13:35:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 13:35:50,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:50,902 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:50,902 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:50,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510122, now seen corresponding path program 1 times [2018-11-10 13:35:50,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:50,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:50,944 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 13:35:50,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:35:50,945 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:50,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:35:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:35:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:35:50,946 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-11-10 13:35:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:51,045 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-10 13:35:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:35:51,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 13:35:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:51,047 INFO L225 Difference]: With dead ends: 64 [2018-11-10 13:35:51,047 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 13:35:51,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:35:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 13:35:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-10 13:35:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 13:35:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-11-10 13:35:51,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2018-11-10 13:35:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:51,051 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-11-10 13:35:51,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:35:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-10 13:35:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 13:35:51,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:51,052 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:51,052 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:51,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:51,053 INFO L82 PathProgramCache]: Analyzing trace with hash 646271685, now seen corresponding path program 1 times [2018-11-10 13:35:51,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:51,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:51,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:51,114 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 13:35:51,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:51,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:35:51,115 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:51,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:35:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:35:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:35:51,116 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 6 states. [2018-11-10 13:35:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:51,235 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-10 13:35:51,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:51,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 13:35:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:51,236 INFO L225 Difference]: With dead ends: 83 [2018-11-10 13:35:51,236 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 13:35:51,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:35:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 13:35:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-11-10 13:35:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 13:35:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-10 13:35:51,242 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 15 [2018-11-10 13:35:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:51,242 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-10 13:35:51,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:35:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-10 13:35:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 13:35:51,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:51,243 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:51,243 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:51,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash -361022790, now seen corresponding path program 1 times [2018-11-10 13:35:51,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:51,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:51,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:51,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:51,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:51,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 13:35:51,350 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [15], [17], [19], [28], [32], [37], [77], [78], [79], [81] [2018-11-10 13:35:51,379 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:51,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:35:51,612 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:35:51,613 INFO L272 AbstractInterpreter]: Visited 17 different actions 33 times. Merged at 6 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 13:35:51,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:51,625 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:35:51,741 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 81.4% of their original sizes. [2018-11-10 13:35:51,741 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:35:51,894 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 13:35:51,894 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:35:51,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:35:51,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-11-10 13:35:51,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:51,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 13:35:51,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:35:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:51,897 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 10 states. [2018-11-10 13:35:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:52,317 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-10 13:35:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:35:52,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-10 13:35:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:52,318 INFO L225 Difference]: With dead ends: 76 [2018-11-10 13:35:52,318 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 13:35:52,319 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:35:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 13:35:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-11-10 13:35:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 13:35:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-11-10 13:35:52,324 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 19 [2018-11-10 13:35:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:52,325 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-10 13:35:52,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 13:35:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-10 13:35:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 13:35:52,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:52,326 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:52,326 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:52,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 949451228, now seen corresponding path program 1 times [2018-11-10 13:35:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:52,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:52,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:52,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:52,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:52,424 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 13:35:52,424 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [13], [15], [16], [17], [19], [28], [32], [37], [77], [78], [79], [81] [2018-11-10 13:35:52,426 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:52,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:35:52,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:35:52,529 INFO L272 AbstractInterpreter]: Visited 17 different actions 33 times. Merged at 7 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 13:35:52,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:52,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:35:52,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:52,539 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:35:52,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:52,552 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:35:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:52,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:52,608 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 13:35:52,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,634 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 13:35:52,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:52,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:52,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:35:52,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2018-11-10 13:35:52,788 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:35:52,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:35:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:35:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-10 13:35:52,788 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-11-10 13:35:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:52,944 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-10 13:35:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:35:52,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-10 13:35:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:52,945 INFO L225 Difference]: With dead ends: 101 [2018-11-10 13:35:52,946 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 13:35:52,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:35:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 13:35:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2018-11-10 13:35:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 13:35:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-10 13:35:52,952 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 21 [2018-11-10 13:35:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:52,952 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-10 13:35:52,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:35:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-10 13:35:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 13:35:52,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:52,953 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:52,953 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:52,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1841873058, now seen corresponding path program 1 times [2018-11-10 13:35:52,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:52,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:52,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:52,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:53,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:53,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:53,024 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 13:35:53,024 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [40], [77], [78], [79], [81], [82] [2018-11-10 13:35:53,026 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:53,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:35:53,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:35:53,120 INFO L272 AbstractInterpreter]: Visited 22 different actions 44 times. Merged at 12 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-10 13:35:53,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:53,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:35:53,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:53,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:35:53,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:53,156 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:35:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:53,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:53,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:53,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:35:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-10 13:35:53,305 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:35:53,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 13:35:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:35:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:35:53,306 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 10 states. [2018-11-10 13:35:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:53,439 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-10 13:35:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:35:53,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-10 13:35:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:53,440 INFO L225 Difference]: With dead ends: 103 [2018-11-10 13:35:53,440 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 13:35:53,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:35:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 13:35:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2018-11-10 13:35:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 13:35:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-10 13:35:53,443 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 23 [2018-11-10 13:35:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:53,444 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-10 13:35:53,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 13:35:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-10 13:35:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 13:35:53,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:53,444 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:53,445 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:53,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash -924863565, now seen corresponding path program 2 times [2018-11-10 13:35:53,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:53,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:53,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:53,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 13:35:53,508 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:53,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:35:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:35:53,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:35:53,509 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 8 states. [2018-11-10 13:35:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:53,556 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-10 13:35:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:53,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-10 13:35:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:53,557 INFO L225 Difference]: With dead ends: 89 [2018-11-10 13:35:53,557 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 13:35:53,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:35:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 13:35:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2018-11-10 13:35:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 13:35:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-10 13:35:53,560 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 27 [2018-11-10 13:35:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:53,560 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-10 13:35:53,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:35:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-10 13:35:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 13:35:53,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:53,561 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:53,561 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:53,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash 216654009, now seen corresponding path program 2 times [2018-11-10 13:35:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:53,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:35:53,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:35:53,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:53,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:35:53,599 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:53,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:53,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:53,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:53,599 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2018-11-10 13:35:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:53,629 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-10 13:35:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:53,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-10 13:35:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:53,630 INFO L225 Difference]: With dead ends: 74 [2018-11-10 13:35:53,630 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 13:35:53,630 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 13:35:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 13:35:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-10 13:35:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 13:35:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-10 13:35:53,632 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 29 [2018-11-10 13:35:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:53,633 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-10 13:35:53,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-10 13:35:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 13:35:53,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:53,636 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:53,636 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:53,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1873660240, now seen corresponding path program 1 times [2018-11-10 13:35:53,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:53,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:35:53,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:35:53,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:53,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:35:53,678 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:53,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:53,678 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 4 states. [2018-11-10 13:35:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:53,718 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-10 13:35:53,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:35:53,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-10 13:35:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:53,720 INFO L225 Difference]: With dead ends: 96 [2018-11-10 13:35:53,720 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 13:35:53,720 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 13:35:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 13:35:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2018-11-10 13:35:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 13:35:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-10 13:35:53,723 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 30 [2018-11-10 13:35:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:53,724 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-10 13:35:53,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-10 13:35:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 13:35:53,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:53,725 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:35:53,726 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:53,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1498621564, now seen corresponding path program 1 times [2018-11-10 13:35:53,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:53,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:35:53,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:35:53,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:53,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:35:53,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:35:53,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:35:53,776 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-11-10 13:35:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:53,802 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-10 13:35:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:35:53,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-10 13:35:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:53,803 INFO L225 Difference]: With dead ends: 75 [2018-11-10 13:35:53,803 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 13:35:53,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 13:35:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 13:35:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 13:35:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-10 13:35:53,805 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 37 [2018-11-10 13:35:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:53,805 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-10 13:35:53,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:35:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-10 13:35:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 13:35:53,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:53,806 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:35:53,807 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:53,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash 787371864, now seen corresponding path program 1 times [2018-11-10 13:35:53,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:53,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:35:53,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:53,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:53,849 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-10 13:35:53,849 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [61], [77], [78], [79], [81], [82] [2018-11-10 13:35:53,851 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:53,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:35:56,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:35:56,187 INFO L272 AbstractInterpreter]: Visited 30 different actions 997 times. Merged at 16 different actions 753 times. Widened at 2 different actions 28 times. Found 57 fixpoints after 5 different actions. Largest state had 30 variables. [2018-11-10 13:35:56,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:56,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:35:56,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:56,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:35:56,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:56,205 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:35:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:56,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:35:56,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:35:56,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:35:56,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-10 13:35:56,289 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:35:56,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:35:56,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:35:56,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:56,290 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2018-11-10 13:35:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:56,314 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-10 13:35:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:56,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 13:35:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:56,315 INFO L225 Difference]: With dead ends: 102 [2018-11-10 13:35:56,315 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 13:35:56,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 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 13:35:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 13:35:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-11-10 13:35:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 13:35:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-11-10 13:35:56,318 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-11-10 13:35:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:56,318 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-11-10 13:35:56,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:35:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-10 13:35:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 13:35:56,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:56,319 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:56,320 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:56,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1786608099, now seen corresponding path program 1 times [2018-11-10 13:35:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:56,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:56,321 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:56,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:56,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:56,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-10 13:35:56,387 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-11-10 13:35:56,388 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:56,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:35:58,256 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:35:58,256 INFO L272 AbstractInterpreter]: Visited 25 different actions 1054 times. Merged at 16 different actions 753 times. Widened at 2 different actions 28 times. Found 57 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-10 13:35:58,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:58,265 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:35:58,355 INFO L227 lantSequenceWeakener]: Weakened 49 states. On average, predicates are now at 71.32% of their original sizes. [2018-11-10 13:35:58,355 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:35:58,561 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-10 13:35:58,561 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:35:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:35:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [8] total 24 [2018-11-10 13:35:58,561 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:58,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 13:35:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 13:35:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:35:58,562 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 18 states. [2018-11-10 13:35:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:59,150 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-10 13:35:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 13:35:59,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-11-10 13:35:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:59,151 INFO L225 Difference]: With dead ends: 83 [2018-11-10 13:35:59,151 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 13:35:59,151 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-11-10 13:35:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 13:35:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-10 13:35:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 13:35:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-11-10 13:35:59,153 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 50 [2018-11-10 13:35:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:59,153 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-11-10 13:35:59,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 13:35:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-10 13:35:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 13:35:59,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:59,154 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:59,154 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:35:59,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1056533819, now seen corresponding path program 1 times [2018-11-10 13:35:59,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:59,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:35:59,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:59,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:59,241 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-10 13:35:59,241 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [16], [17], [19], [23], [24], [28], [32], [37], [39], [41], [43], [45], [77], [78], [79], [81], [82] [2018-11-10 13:35:59,242 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:59,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:36:01,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:36:01,124 INFO L272 AbstractInterpreter]: Visited 25 different actions 1054 times. Merged at 17 different actions 816 times. Widened at 2 different actions 28 times. Found 57 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-10 13:36:01,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:01,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:36:01,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:01,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:01,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:01,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:01,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:01,173 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 13:36:01,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:01,202 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 13:36:01,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:36:01,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:36:01,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:01,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2018-11-10 13:36:01,413 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:01,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 13:36:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 13:36:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:36:01,414 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 15 states. [2018-11-10 13:36:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:01,586 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-11-10 13:36:01,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:36:01,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-11-10 13:36:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:01,588 INFO L225 Difference]: With dead ends: 99 [2018-11-10 13:36:01,588 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 13:36:01,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2018-11-10 13:36:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 13:36:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-11-10 13:36:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 13:36:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-11-10 13:36:01,591 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 52 [2018-11-10 13:36:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:01,591 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-11-10 13:36:01,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 13:36:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-11-10 13:36:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 13:36:01,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:01,592 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:01,592 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:01,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1137911390, now seen corresponding path program 1 times [2018-11-10 13:36:01,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:01,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:01,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:36:01,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:01,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:01,648 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 13:36:01,648 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [42], [43], [45], [77], [78], [79], [81], [82] [2018-11-10 13:36:01,649 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:36:01,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:36:03,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:36:03,777 INFO L272 AbstractInterpreter]: Visited 25 different actions 1028 times. Merged at 17 different actions 802 times. Widened at 2 different actions 28 times. Found 57 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-10 13:36:03,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:03,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:36:03,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:03,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:03,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:03,787 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:03,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:36:03,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:36:03,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:03,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-10 13:36:03,939 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:03,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:36:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:36:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-10 13:36:03,940 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 12 states. [2018-11-10 13:36:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:04,042 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-11-10 13:36:04,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:36:04,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-10 13:36:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:04,044 INFO L225 Difference]: With dead ends: 97 [2018-11-10 13:36:04,044 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 13:36:04,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:36:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 13:36:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-11-10 13:36:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 13:36:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-11-10 13:36:04,047 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 55 [2018-11-10 13:36:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:04,047 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-11-10 13:36:04,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:36:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-11-10 13:36:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 13:36:04,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:04,048 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:04,048 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:04,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1121404452, now seen corresponding path program 2 times [2018-11-10 13:36:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:04,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:04,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:04,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:04,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 80 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:36:04,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:04,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:04,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:04,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:04,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:04,132 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:04,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:04,140 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:04,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:36:04,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:04,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:04,168 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 13:36:04,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:04,179 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 13:36:04,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-11-10 13:36:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 55 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 13:36:04,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 55 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 13:36:04,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:04,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2018-11-10 13:36:04,427 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:04,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 13:36:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 13:36:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:36:04,428 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 17 states. [2018-11-10 13:36:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:04,737 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2018-11-10 13:36:04,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 13:36:04,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-11-10 13:36:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:04,738 INFO L225 Difference]: With dead ends: 131 [2018-11-10 13:36:04,739 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 13:36:04,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 13:36:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 13:36:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2018-11-10 13:36:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 13:36:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-11-10 13:36:04,744 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 58 [2018-11-10 13:36:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:04,744 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-11-10 13:36:04,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 13:36:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-11-10 13:36:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 13:36:04,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:04,745 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:04,745 INFO L424 AbstractCegarLoop]: === Iteration 18 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:04,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1312166887, now seen corresponding path program 2 times [2018-11-10 13:36:04,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:04,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:04,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 13:36:04,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:04,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:04,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:04,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:04,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:04,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:04,886 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:04,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:36:04,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:04,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:04,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 13:36:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 13:36:04,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:04,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:04,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:36:04,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:04,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:04,934 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-11-10 13:36:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 13:36:04,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 13:36:05,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:05,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2018-11-10 13:36:05,045 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:05,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:36:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:36:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-10 13:36:05,045 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 12 states. [2018-11-10 13:36:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:05,267 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-11-10 13:36:05,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:36:05,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-10 13:36:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:05,269 INFO L225 Difference]: With dead ends: 131 [2018-11-10 13:36:05,269 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 13:36:05,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2018-11-10 13:36:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 13:36:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2018-11-10 13:36:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 13:36:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-11-10 13:36:05,272 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 61 [2018-11-10 13:36:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:05,272 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-11-10 13:36:05,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:36:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-11-10 13:36:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 13:36:05,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:05,273 INFO L375 BasicCegarLoop]: trace histogram [11, 9, 9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:05,274 INFO L424 AbstractCegarLoop]: === Iteration 19 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:05,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1895378579, now seen corresponding path program 3 times [2018-11-10 13:36:05,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:05,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:05,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 157 proven. 22 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 13:36:05,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:05,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:05,434 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:05,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:05,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:05,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:05,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:05,440 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:05,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:05,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:05,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:05,479 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 13:36:05,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:05,483 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 13:36:05,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 148 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:36:05,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 90 proven. 143 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:36:06,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:06,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 38 [2018-11-10 13:36:06,037 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:06,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 13:36:06,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 13:36:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 13:36:06,039 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 27 states. [2018-11-10 13:36:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:06,734 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2018-11-10 13:36:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 13:36:06,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 89 [2018-11-10 13:36:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:06,735 INFO L225 Difference]: With dead ends: 180 [2018-11-10 13:36:06,735 INFO L226 Difference]: Without dead ends: 180 [2018-11-10 13:36:06,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=506, Invalid=2464, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 13:36:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-10 13:36:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 156. [2018-11-10 13:36:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 13:36:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-11-10 13:36:06,739 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 89 [2018-11-10 13:36:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:06,739 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-11-10 13:36:06,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 13:36:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-11-10 13:36:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:36:06,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:06,740 INFO L375 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:06,740 INFO L424 AbstractCegarLoop]: === Iteration 20 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:06,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash 292900984, now seen corresponding path program 2 times [2018-11-10 13:36:06,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:06,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:06,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-10 13:36:06,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:06,791 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:06,791 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:06,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:06,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:06,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:06,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:06,801 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:06,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 13:36:06,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:06,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:06,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:36:06,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 13:36:06,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 13:36:06,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,842 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,847 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-10 13:36:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-10 13:36:06,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-10 13:36:07,045 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:36:07,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 13 [2018-11-10 13:36:07,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:36:07,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:36:07,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:36:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:36:07,046 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 6 states. [2018-11-10 13:36:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:07,082 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-11-10 13:36:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:36:07,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-10 13:36:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:07,083 INFO L225 Difference]: With dead ends: 155 [2018-11-10 13:36:07,083 INFO L226 Difference]: Without dead ends: 155 [2018-11-10 13:36:07,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 189 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:36:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-10 13:36:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-11-10 13:36:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 13:36:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2018-11-10 13:36:07,087 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 100 [2018-11-10 13:36:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:07,087 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2018-11-10 13:36:07,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:36:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2018-11-10 13:36:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 13:36:07,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:07,088 INFO L375 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:07,089 INFO L424 AbstractCegarLoop]: === Iteration 21 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:07,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1560236719, now seen corresponding path program 1 times [2018-11-10 13:36:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:07,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:07,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-10 13:36:07,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:07,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:07,152 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2018-11-10 13:36:07,152 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [62], [65], [67], [76], [77], [78], [79], [81], [82] [2018-11-10 13:36:07,155 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:36:07,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:36:08,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:36:08,795 INFO L272 AbstractInterpreter]: Visited 33 different actions 1000 times. Merged at 16 different actions 753 times. Widened at 2 different actions 28 times. Found 57 fixpoints after 5 different actions. Largest state had 36 variables. [2018-11-10 13:36:08,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:08,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:36:08,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:08,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:08,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:08,804 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:08,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-10 13:36:08,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-10 13:36:08,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:08,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 18 [2018-11-10 13:36:08,984 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:08,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 13:36:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 13:36:08,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:36:08,985 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 14 states. [2018-11-10 13:36:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:09,109 INFO L93 Difference]: Finished difference Result 205 states and 210 transitions. [2018-11-10 13:36:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 13:36:09,109 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-10 13:36:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:09,110 INFO L225 Difference]: With dead ends: 205 [2018-11-10 13:36:09,110 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 13:36:09,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 190 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2018-11-10 13:36:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 13:36:09,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 173. [2018-11-10 13:36:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 13:36:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2018-11-10 13:36:09,114 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 103 [2018-11-10 13:36:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:09,114 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2018-11-10 13:36:09,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 13:36:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2018-11-10 13:36:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:36:09,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:09,115 INFO L375 BasicCegarLoop]: trace histogram [17, 14, 14, 14, 13, 13, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:09,115 INFO L424 AbstractCegarLoop]: === Iteration 22 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:09,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1315564900, now seen corresponding path program 4 times [2018-11-10 13:36:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:09,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 294 proven. 56 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-11-10 13:36:09,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:09,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:09,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:09,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:09,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:09,258 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:09,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:09,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:09,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:09,305 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 13:36:09,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:09,309 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 13:36:09,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 294 proven. 56 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-11-10 13:36:09,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 294 proven. 56 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-11-10 13:36:09,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:09,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 26 [2018-11-10 13:36:09,691 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:09,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:36:09,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:36:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:36:09,692 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand 19 states. [2018-11-10 13:36:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:10,055 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-11-10 13:36:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:36:10,055 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 132 [2018-11-10 13:36:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:10,057 INFO L225 Difference]: With dead ends: 208 [2018-11-10 13:36:10,057 INFO L226 Difference]: Without dead ends: 208 [2018-11-10 13:36:10,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 242 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 13:36:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-10 13:36:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 179. [2018-11-10 13:36:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 13:36:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 187 transitions. [2018-11-10 13:36:10,060 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 187 transitions. Word has length 132 [2018-11-10 13:36:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:10,061 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 187 transitions. [2018-11-10 13:36:10,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:36:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 187 transitions. [2018-11-10 13:36:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 13:36:10,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:10,062 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 14, 14, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:10,062 INFO L424 AbstractCegarLoop]: === Iteration 23 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:10,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1798880371, now seen corresponding path program 5 times [2018-11-10 13:36:10,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:10,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:10,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 425 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-10 13:36:10,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:10,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:10,147 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:10,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:10,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:10,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:10,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:10,153 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:10,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 13:36:10,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:10,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:10,186 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 13:36:10,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:10,190 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 13:36:10,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-11-10 13:36:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 354 proven. 45 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-10 13:36:10,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 354 proven. 45 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-10 13:36:10,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:10,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2018-11-10 13:36:10,578 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:10,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 13:36:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 13:36:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-11-10 13:36:10,579 INFO L87 Difference]: Start difference. First operand 179 states and 187 transitions. Second operand 23 states. [2018-11-10 13:36:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:10,961 INFO L93 Difference]: Finished difference Result 242 states and 248 transitions. [2018-11-10 13:36:10,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 13:36:10,961 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 138 [2018-11-10 13:36:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:10,962 INFO L225 Difference]: With dead ends: 242 [2018-11-10 13:36:10,962 INFO L226 Difference]: Without dead ends: 242 [2018-11-10 13:36:10,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 13:36:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-10 13:36:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-11-10 13:36:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-10 13:36:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 231 transitions. [2018-11-10 13:36:10,968 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 231 transitions. Word has length 138 [2018-11-10 13:36:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:10,969 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 231 transitions. [2018-11-10 13:36:10,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 13:36:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 231 transitions. [2018-11-10 13:36:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 13:36:10,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:10,970 INFO L375 BasicCegarLoop]: trace histogram [17, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:10,970 INFO L424 AbstractCegarLoop]: === Iteration 24 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:10,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 905268634, now seen corresponding path program 2 times [2018-11-10 13:36:10,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:10,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:10,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-11-10 13:36:11,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:11,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:11,038 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:11,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:11,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:11,038 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:11,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:11,044 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:11,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 13:36:11,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:11,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:11,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:11,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 13:36:11,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 13:36:11,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:36:11,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 13:36:11,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:11,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 13:36:11,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 13:36:11,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:36:11,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 13:36:11,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:11,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 13:36:11,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:11,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 13:36:11,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:36:11,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 13:36:11,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:11,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 13:36:11,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 13:36:11,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:36:11,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 13:36:11,266 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int) (|v_main_~#b~0.base_21| Int)) (let ((.cse0 (store |c_old(#valid)| |v_main_~#b~0.base_21| 1))) (and (= (select .cse0 main_ULTIMATE.dealloc_~addr.base) 0) (= |c_#valid| (store (store (store .cse0 main_ULTIMATE.dealloc_~addr.base 1) |v_main_~#b~0.base_21| 0) main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select |c_old(#valid)| |v_main_~#b~0.base_21|))))) is different from true [2018-11-10 13:36:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2018-11-10 13:36:11,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:11,362 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~0.base_25| Int) (|v_main_~#b~0.base_23| Int)) (let ((.cse0 (store |c_#valid| |v_main_~#b~0.base_23| 1))) (or (not (= 0 (select |c_#valid| |v_main_~#b~0.base_23|))) (= (store (store (store .cse0 |v_main_~#mask~0.base_25| 1) |v_main_~#b~0.base_23| 0) |v_main_~#mask~0.base_25| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_~#mask~0.base_25|) 0))))) is different from false [2018-11-10 13:36:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2018-11-10 13:36:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:36:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 13 [2018-11-10 13:36:11,410 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:36:11,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:36:11,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:36:11,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=81, Unknown=2, NotChecked=38, Total=156 [2018-11-10 13:36:11,411 INFO L87 Difference]: Start difference. First operand 222 states and 231 transitions. Second operand 6 states. [2018-11-10 13:36:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:11,485 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2018-11-10 13:36:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:36:11,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-11-10 13:36:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:11,487 INFO L225 Difference]: With dead ends: 222 [2018-11-10 13:36:11,487 INFO L226 Difference]: Without dead ends: 191 [2018-11-10 13:36:11,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 280 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2018-11-10 13:36:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-10 13:36:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-11-10 13:36:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 13:36:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2018-11-10 13:36:11,490 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 146 [2018-11-10 13:36:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:11,490 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2018-11-10 13:36:11,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:36:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2018-11-10 13:36:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:36:11,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:11,491 INFO L375 BasicCegarLoop]: trace histogram [23, 19, 19, 19, 18, 18, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:11,492 INFO L424 AbstractCegarLoop]: === Iteration 25 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:11,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash -506660415, now seen corresponding path program 6 times [2018-11-10 13:36:11,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:11,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:11,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:11,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:11,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1254 backedges. 876 proven. 189 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-10 13:36:11,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:11,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:11,605 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:11,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:11,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:11,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:11,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:11,612 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:11,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:11,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:11,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1254 backedges. 771 proven. 233 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-10 13:36:11,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1254 backedges. 779 proven. 225 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-10 13:36:11,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:11,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2018-11-10 13:36:11,982 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:11,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 13:36:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 13:36:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 13:36:11,983 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 26 states. [2018-11-10 13:36:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:12,321 INFO L93 Difference]: Finished difference Result 201 states and 203 transitions. [2018-11-10 13:36:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 13:36:12,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 175 [2018-11-10 13:36:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:12,323 INFO L225 Difference]: With dead ends: 201 [2018-11-10 13:36:12,323 INFO L226 Difference]: Without dead ends: 195 [2018-11-10 13:36:12,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 327 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 13:36:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-10 13:36:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-11-10 13:36:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 13:36:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2018-11-10 13:36:12,327 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 175 [2018-11-10 13:36:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:12,328 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2018-11-10 13:36:12,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 13:36:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2018-11-10 13:36:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 13:36:12,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:12,329 INFO L375 BasicCegarLoop]: trace histogram [24, 20, 20, 20, 19, 19, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:12,329 INFO L424 AbstractCegarLoop]: === Iteration 26 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:12,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash -49860726, now seen corresponding path program 7 times [2018-11-10 13:36:12,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:12,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:12,330 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 564 proven. 69 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2018-11-10 13:36:12,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:12,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:12,557 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:12,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:12,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:12,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:12,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:12,568 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:12,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:12,645 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 13:36:12,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:12,654 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 13:36:12,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 542 proven. 85 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-11-10 13:36:12,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 542 proven. 85 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-11-10 13:36:13,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:13,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 31 [2018-11-10 13:36:13,069 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:13,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 13:36:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 13:36:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2018-11-10 13:36:13,070 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand 23 states. [2018-11-10 13:36:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:13,788 INFO L93 Difference]: Finished difference Result 276 states and 283 transitions. [2018-11-10 13:36:13,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 13:36:13,789 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2018-11-10 13:36:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:13,791 INFO L225 Difference]: With dead ends: 276 [2018-11-10 13:36:13,791 INFO L226 Difference]: Without dead ends: 276 [2018-11-10 13:36:13,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 336 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 13:36:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-10 13:36:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 240. [2018-11-10 13:36:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 13:36:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 244 transitions. [2018-11-10 13:36:13,796 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 244 transitions. Word has length 181 [2018-11-10 13:36:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:13,796 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 244 transitions. [2018-11-10 13:36:13,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 13:36:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2018-11-10 13:36:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 13:36:13,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:13,797 INFO L375 BasicCegarLoop]: trace histogram [31, 26, 26, 26, 25, 25, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:13,797 INFO L424 AbstractCegarLoop]: === Iteration 27 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:13,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 574605482, now seen corresponding path program 8 times [2018-11-10 13:36:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:13,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 1389 proven. 402 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-10 13:36:13,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:13,988 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:13,988 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:13,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:13,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:13,988 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:13,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:13,998 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:14,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 13:36:14,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:14,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 1309 proven. 274 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-11-10 13:36:14,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 1309 proven. 274 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-11-10 13:36:14,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:14,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 47 [2018-11-10 13:36:14,656 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:14,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 13:36:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 13:36:14,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 13:36:14,657 INFO L87 Difference]: Start difference. First operand 240 states and 244 transitions. Second operand 34 states. [2018-11-10 13:36:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:15,418 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2018-11-10 13:36:15,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 13:36:15,420 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 230 [2018-11-10 13:36:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:15,421 INFO L225 Difference]: With dead ends: 260 [2018-11-10 13:36:15,421 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 13:36:15,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 428 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1742 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=957, Invalid=5049, Unknown=0, NotChecked=0, Total=6006 [2018-11-10 13:36:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 13:36:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2018-11-10 13:36:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-10 13:36:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 248 transitions. [2018-11-10 13:36:15,425 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 248 transitions. Word has length 230 [2018-11-10 13:36:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:15,425 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 248 transitions. [2018-11-10 13:36:15,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 13:36:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 248 transitions. [2018-11-10 13:36:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-10 13:36:15,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:15,426 INFO L375 BasicCegarLoop]: trace histogram [32, 27, 27, 27, 26, 26, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:15,427 INFO L424 AbstractCegarLoop]: === Iteration 28 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:15,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash -177185229, now seen corresponding path program 9 times [2018-11-10 13:36:15,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:15,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:15,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 997 proven. 103 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-10 13:36:15,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:15,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:15,671 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:15,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:15,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:15,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:15,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:15,679 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:15,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:15,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:15,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:15,757 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 13:36:15,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,774 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 13:36:15,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 814 proven. 514 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-11-10 13:36:16,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 819 proven. 509 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-11-10 13:36:16,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:16,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 50 [2018-11-10 13:36:16,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:16,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 13:36:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 13:36:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2257, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 13:36:16,616 INFO L87 Difference]: Start difference. First operand 246 states and 248 transitions. Second operand 36 states. [2018-11-10 13:36:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:17,743 INFO L93 Difference]: Finished difference Result 328 states and 334 transitions. [2018-11-10 13:36:17,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 13:36:17,743 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 236 [2018-11-10 13:36:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:17,744 INFO L225 Difference]: With dead ends: 328 [2018-11-10 13:36:17,744 INFO L226 Difference]: Without dead ends: 328 [2018-11-10 13:36:17,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 435 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=829, Invalid=4573, Unknown=0, NotChecked=0, Total=5402 [2018-11-10 13:36:17,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-10 13:36:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 301. [2018-11-10 13:36:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-11-10 13:36:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 305 transitions. [2018-11-10 13:36:17,749 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 305 transitions. Word has length 236 [2018-11-10 13:36:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:17,749 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 305 transitions. [2018-11-10 13:36:17,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 13:36:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 305 transitions. [2018-11-10 13:36:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-10 13:36:17,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:17,751 INFO L375 BasicCegarLoop]: trace histogram [40, 34, 34, 34, 33, 33, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:17,751 INFO L424 AbstractCegarLoop]: === Iteration 29 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:17,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash 554759992, now seen corresponding path program 10 times [2018-11-10 13:36:17,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:17,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:17,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2649 proven. 393 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2018-11-10 13:36:18,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:18,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:18,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:18,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:18,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:18,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:18,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:18,012 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:18,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2292 proven. 102 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2018-11-10 13:36:18,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2292 proven. 102 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2018-11-10 13:36:18,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:18,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 38 [2018-11-10 13:36:18,591 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:18,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 13:36:18,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 13:36:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 13:36:18,592 INFO L87 Difference]: Start difference. First operand 301 states and 305 transitions. Second operand 31 states. [2018-11-10 13:36:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:19,075 INFO L93 Difference]: Finished difference Result 321 states and 324 transitions. [2018-11-10 13:36:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 13:36:19,075 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 291 [2018-11-10 13:36:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:19,076 INFO L225 Difference]: With dead ends: 321 [2018-11-10 13:36:19,076 INFO L226 Difference]: Without dead ends: 315 [2018-11-10 13:36:19,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 558 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=657, Invalid=2535, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 13:36:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-10 13:36:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2018-11-10 13:36:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-10 13:36:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 310 transitions. [2018-11-10 13:36:19,082 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 310 transitions. Word has length 291 [2018-11-10 13:36:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:19,083 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 310 transitions. [2018-11-10 13:36:19,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 13:36:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 310 transitions. [2018-11-10 13:36:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 13:36:19,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:19,084 INFO L375 BasicCegarLoop]: trace histogram [41, 35, 35, 35, 34, 34, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:19,084 INFO L424 AbstractCegarLoop]: === Iteration 30 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:19,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:19,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1882782913, now seen corresponding path program 11 times [2018-11-10 13:36:19,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:19,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:19,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4175 backedges. 2179 proven. 506 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2018-11-10 13:36:19,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:19,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:19,501 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:19,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:19,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:19,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:19,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:19,508 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:19,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 13:36:19,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:19,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:19,622 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 13:36:19,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,647 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 13:36:19,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4175 backedges. 1666 proven. 406 refuted. 0 times theorem prover too weak. 2103 trivial. 0 not checked. [2018-11-10 13:36:20,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4175 backedges. 1371 proven. 161 refuted. 0 times theorem prover too weak. 2643 trivial. 0 not checked. [2018-11-10 13:36:20,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:20,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 12] total 49 [2018-11-10 13:36:20,611 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:20,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 13:36:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 13:36:20,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2117, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 13:36:20,612 INFO L87 Difference]: Start difference. First operand 307 states and 310 transitions. Second operand 39 states. [2018-11-10 13:36:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:22,064 INFO L93 Difference]: Finished difference Result 405 states and 413 transitions. [2018-11-10 13:36:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 13:36:22,064 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 297 [2018-11-10 13:36:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:22,066 INFO L225 Difference]: With dead ends: 405 [2018-11-10 13:36:22,066 INFO L226 Difference]: Without dead ends: 405 [2018-11-10 13:36:22,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 560 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1429, Invalid=5377, Unknown=0, NotChecked=0, Total=6806 [2018-11-10 13:36:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-11-10 13:36:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 325. [2018-11-10 13:36:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-10 13:36:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 330 transitions. [2018-11-10 13:36:22,072 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 330 transitions. Word has length 297 [2018-11-10 13:36:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:22,073 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 330 transitions. [2018-11-10 13:36:22,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 13:36:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 330 transitions. [2018-11-10 13:36:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-10 13:36:22,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:22,074 INFO L375 BasicCegarLoop]: trace histogram [43, 37, 37, 37, 36, 36, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:22,075 INFO L424 AbstractCegarLoop]: === Iteration 31 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:22,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1177663201, now seen corresponding path program 12 times [2018-11-10 13:36:22,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:22,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:22,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 2861 proven. 149 refuted. 0 times theorem prover too weak. 1613 trivial. 0 not checked. [2018-11-10 13:36:22,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:22,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:22,242 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:22,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:22,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:22,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:22,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:22,248 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:22,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:22,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:22,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 2775 proven. 533 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2018-11-10 13:36:22,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 2819 proven. 489 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2018-11-10 13:36:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 42 [2018-11-10 13:36:22,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:22,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 13:36:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 13:36:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 13:36:22,840 INFO L87 Difference]: Start difference. First operand 325 states and 330 transitions. Second operand 31 states. [2018-11-10 13:36:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:23,115 INFO L93 Difference]: Finished difference Result 339 states and 345 transitions. [2018-11-10 13:36:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 13:36:23,115 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 309 [2018-11-10 13:36:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:23,116 INFO L225 Difference]: With dead ends: 339 [2018-11-10 13:36:23,116 INFO L226 Difference]: Without dead ends: 339 [2018-11-10 13:36:23,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 586 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=455, Invalid=1897, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 13:36:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-10 13:36:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 332. [2018-11-10 13:36:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-10 13:36:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 338 transitions. [2018-11-10 13:36:23,123 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 338 transitions. Word has length 309 [2018-11-10 13:36:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:23,124 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 338 transitions. [2018-11-10 13:36:23,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 13:36:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 338 transitions. [2018-11-10 13:36:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-10 13:36:23,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:23,129 INFO L375 BasicCegarLoop]: trace histogram [51, 44, 44, 44, 43, 43, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:23,130 INFO L424 AbstractCegarLoop]: === Iteration 32 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:23,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1455904138, now seen corresponding path program 13 times [2018-11-10 13:36:23,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:23,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:23,131 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6550 backedges. 1988 proven. 208 refuted. 0 times theorem prover too weak. 4354 trivial. 0 not checked. [2018-11-10 13:36:23,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:23,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:23,466 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:23,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:23,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:23,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:23,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:23,475 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:23,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:23,593 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 13:36:23,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:23,620 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 13:36:23,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6550 backedges. 1988 proven. 208 refuted. 0 times theorem prover too weak. 4354 trivial. 0 not checked. [2018-11-10 13:36:24,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6550 backedges. 1988 proven. 208 refuted. 0 times theorem prover too weak. 4354 trivial. 0 not checked. [2018-11-10 13:36:24,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:24,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 38 [2018-11-10 13:36:24,470 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:24,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 13:36:24,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 13:36:24,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 13:36:24,470 INFO L87 Difference]: Start difference. First operand 332 states and 338 transitions. Second operand 27 states. [2018-11-10 13:36:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:25,061 INFO L93 Difference]: Finished difference Result 370 states and 380 transitions. [2018-11-10 13:36:25,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:36:25,061 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 364 [2018-11-10 13:36:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:25,063 INFO L225 Difference]: With dead ends: 370 [2018-11-10 13:36:25,063 INFO L226 Difference]: Without dead ends: 370 [2018-11-10 13:36:25,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 690 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=463, Invalid=1987, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 13:36:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-11-10 13:36:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 338. [2018-11-10 13:36:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 13:36:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 345 transitions. [2018-11-10 13:36:25,069 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 345 transitions. Word has length 364 [2018-11-10 13:36:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:25,069 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 345 transitions. [2018-11-10 13:36:25,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 13:36:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 345 transitions. [2018-11-10 13:36:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-10 13:36:25,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:25,071 INFO L375 BasicCegarLoop]: trace histogram [52, 45, 45, 45, 44, 44, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:25,072 INFO L424 AbstractCegarLoop]: === Iteration 33 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:25,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash 821794017, now seen corresponding path program 14 times [2018-11-10 13:36:25,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:25,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:25,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:25,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:25,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6827 backedges. 2447 proven. 194 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-11-10 13:36:25,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:25,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:25,328 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:25,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:25,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:25,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:25,351 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:25,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 13:36:25,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:25,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6827 backedges. 3526 proven. 652 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-10 13:36:25,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6827 backedges. 3526 proven. 652 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-10 13:36:26,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:26,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 25] total 51 [2018-11-10 13:36:26,209 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:26,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 13:36:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 13:36:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=2141, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 13:36:26,210 INFO L87 Difference]: Start difference. First operand 338 states and 345 transitions. Second operand 42 states. [2018-11-10 13:36:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:26,881 INFO L93 Difference]: Finished difference Result 422 states and 430 transitions. [2018-11-10 13:36:26,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-10 13:36:26,881 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 370 [2018-11-10 13:36:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:26,883 INFO L225 Difference]: With dead ends: 422 [2018-11-10 13:36:26,883 INFO L226 Difference]: Without dead ends: 422 [2018-11-10 13:36:26,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 697 SyntacticMatches, 15 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1209, Invalid=4797, Unknown=0, NotChecked=0, Total=6006 [2018-11-10 13:36:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-11-10 13:36:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2018-11-10 13:36:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-11-10 13:36:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 422 transitions. [2018-11-10 13:36:26,891 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 422 transitions. Word has length 370 [2018-11-10 13:36:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:26,892 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 422 transitions. [2018-11-10 13:36:26,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 13:36:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 422 transitions. [2018-11-10 13:36:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-11-10 13:36:26,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:26,894 INFO L375 BasicCegarLoop]: trace histogram [62, 54, 54, 54, 53, 53, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:26,894 INFO L424 AbstractCegarLoop]: === Iteration 34 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:26,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:26,895 INFO L82 PathProgramCache]: Analyzing trace with hash -763111880, now seen corresponding path program 15 times [2018-11-10 13:36:26,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:26,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:26,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9793 backedges. 2806 proven. 247 refuted. 0 times theorem prover too weak. 6740 trivial. 0 not checked. [2018-11-10 13:36:27,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:27,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:27,267 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:27,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:27,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:27,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:27,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:27,275 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:27,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:27,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:27,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:27,393 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 13:36:27,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,414 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 13:36:27,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9793 backedges. 2650 proven. 1060 refuted. 0 times theorem prover too weak. 6083 trivial. 0 not checked. [2018-11-10 13:36:28,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9793 backedges. 2655 proven. 1055 refuted. 0 times theorem prover too weak. 6083 trivial. 0 not checked. [2018-11-10 13:36:28,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:28,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 19] total 54 [2018-11-10 13:36:28,756 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:28,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-10 13:36:28,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 13:36:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2608, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 13:36:28,757 INFO L87 Difference]: Start difference. First operand 414 states and 422 transitions. Second operand 37 states. [2018-11-10 13:36:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:30,467 INFO L93 Difference]: Finished difference Result 695 states and 720 transitions. [2018-11-10 13:36:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-10 13:36:30,469 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 437 [2018-11-10 13:36:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:30,472 INFO L225 Difference]: With dead ends: 695 [2018-11-10 13:36:30,472 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 13:36:30,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 828 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1201, Invalid=6281, Unknown=0, NotChecked=0, Total=7482 [2018-11-10 13:36:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 13:36:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 651. [2018-11-10 13:36:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-10 13:36:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 673 transitions. [2018-11-10 13:36:30,483 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 673 transitions. Word has length 437 [2018-11-10 13:36:30,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:30,483 INFO L481 AbstractCegarLoop]: Abstraction has 651 states and 673 transitions. [2018-11-10 13:36:30,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-10 13:36:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 673 transitions. [2018-11-10 13:36:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-11-10 13:36:30,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:30,487 INFO L375 BasicCegarLoop]: trace histogram [71, 62, 62, 62, 61, 61, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:30,487 INFO L424 AbstractCegarLoop]: === Iteration 35 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:30,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1655634184, now seen corresponding path program 16 times [2018-11-10 13:36:30,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:30,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:30,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12905 backedges. 4984 proven. 1942 refuted. 0 times theorem prover too weak. 5979 trivial. 0 not checked. [2018-11-10 13:36:30,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:30,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:30,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:30,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:30,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:30,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:30,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:30,887 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:31,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12905 backedges. 7857 proven. 140 refuted. 0 times theorem prover too weak. 4908 trivial. 0 not checked. [2018-11-10 13:36:31,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12905 backedges. 5082 proven. 926 refuted. 0 times theorem prover too weak. 6897 trivial. 0 not checked. [2018-11-10 13:36:31,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:31,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 39 [2018-11-10 13:36:31,562 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:31,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 13:36:31,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 13:36:31,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1176, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 13:36:31,564 INFO L87 Difference]: Start difference. First operand 651 states and 673 transitions. Second operand 31 states. [2018-11-10 13:36:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:31,965 INFO L93 Difference]: Finished difference Result 576 states and 587 transitions. [2018-11-10 13:36:31,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 13:36:31,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 498 [2018-11-10 13:36:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:31,967 INFO L225 Difference]: With dead ends: 576 [2018-11-10 13:36:31,967 INFO L226 Difference]: Without dead ends: 564 [2018-11-10 13:36:31,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 972 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=744, Invalid=2448, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 13:36:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-11-10 13:36:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2018-11-10 13:36:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-10 13:36:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 572 transitions. [2018-11-10 13:36:31,976 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 572 transitions. Word has length 498 [2018-11-10 13:36:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:31,976 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 572 transitions. [2018-11-10 13:36:31,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 13:36:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 572 transitions. [2018-11-10 13:36:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-11-10 13:36:31,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:31,979 INFO L375 BasicCegarLoop]: trace histogram [72, 63, 63, 63, 62, 62, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:31,979 INFO L424 AbstractCegarLoop]: === Iteration 36 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:31,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash 159473345, now seen corresponding path program 17 times [2018-11-10 13:36:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:31,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:31,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:31,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13294 backedges. 5638 proven. 1691 refuted. 0 times theorem prover too weak. 5965 trivial. 0 not checked. [2018-11-10 13:36:32,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:32,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:32,332 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:32,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:32,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:32,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:32,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:32,341 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:32,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 13:36:32,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:32,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13294 backedges. 5390 proven. 1180 refuted. 0 times theorem prover too weak. 6724 trivial. 0 not checked. [2018-11-10 13:36:32,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13294 backedges. 5390 proven. 1180 refuted. 0 times theorem prover too weak. 6724 trivial. 0 not checked. [2018-11-10 13:36:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:33,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 27] total 68 [2018-11-10 13:36:33,566 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:33,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-10 13:36:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-10 13:36:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=3959, Unknown=0, NotChecked=0, Total=4556 [2018-11-10 13:36:33,567 INFO L87 Difference]: Start difference. First operand 561 states and 572 transitions. Second operand 48 states. [2018-11-10 13:36:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:34,756 INFO L93 Difference]: Finished difference Result 500 states and 505 transitions. [2018-11-10 13:36:34,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-10 13:36:34,756 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 504 [2018-11-10 13:36:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:34,757 INFO L225 Difference]: With dead ends: 500 [2018-11-10 13:36:34,757 INFO L226 Difference]: Without dead ends: 491 [2018-11-10 13:36:34,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 960 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4286 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1932, Invalid=11408, Unknown=0, NotChecked=0, Total=13340 [2018-11-10 13:36:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-10 13:36:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2018-11-10 13:36:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-11-10 13:36:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 486 transitions. [2018-11-10 13:36:34,764 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 486 transitions. Word has length 504 [2018-11-10 13:36:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:34,765 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 486 transitions. [2018-11-10 13:36:34,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-10 13:36:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 486 transitions. [2018-11-10 13:36:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-11-10 13:36:34,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:34,768 INFO L375 BasicCegarLoop]: trace histogram [73, 64, 64, 64, 63, 63, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:34,768 INFO L424 AbstractCegarLoop]: === Iteration 37 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:34,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2064522344, now seen corresponding path program 18 times [2018-11-10 13:36:34,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:34,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:34,769 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 6441 proven. 1290 refuted. 0 times theorem prover too weak. 5958 trivial. 0 not checked. [2018-11-10 13:36:35,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:35,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:35,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:35,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:35,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:35,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:35,130 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:35,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:35,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:35,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 6446 proven. 1028 refuted. 0 times theorem prover too weak. 6215 trivial. 0 not checked. [2018-11-10 13:36:35,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 6454 proven. 1020 refuted. 0 times theorem prover too weak. 6215 trivial. 0 not checked. [2018-11-10 13:36:35,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:35,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 52 [2018-11-10 13:36:35,898 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:35,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-10 13:36:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 13:36:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2173, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 13:36:35,899 INFO L87 Difference]: Start difference. First operand 481 states and 486 transitions. Second operand 40 states. [2018-11-10 13:36:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:36,569 INFO L93 Difference]: Finished difference Result 491 states and 494 transitions. [2018-11-10 13:36:36,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 13:36:36,569 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 510 [2018-11-10 13:36:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:36,571 INFO L225 Difference]: With dead ends: 491 [2018-11-10 13:36:36,571 INFO L226 Difference]: Without dead ends: 485 [2018-11-10 13:36:36,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1068 GetRequests, 983 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1233, Invalid=4169, Unknown=0, NotChecked=0, Total=5402 [2018-11-10 13:36:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-10 13:36:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2018-11-10 13:36:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-11-10 13:36:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 484 transitions. [2018-11-10 13:36:36,584 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 484 transitions. Word has length 510 [2018-11-10 13:36:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:36,584 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 484 transitions. [2018-11-10 13:36:36,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-10 13:36:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 484 transitions. [2018-11-10 13:36:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-11-10 13:36:36,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:36,586 INFO L375 BasicCegarLoop]: trace histogram [74, 65, 65, 65, 64, 64, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:36,587 INFO L424 AbstractCegarLoop]: === Iteration 38 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:36,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2064181087, now seen corresponding path program 19 times [2018-11-10 13:36:36,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:36,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:36,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14090 backedges. 3815 proven. 309 refuted. 0 times theorem prover too weak. 9966 trivial. 0 not checked. [2018-11-10 13:36:37,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:37,029 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:37,029 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:37,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:37,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:37,029 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:37,037 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:37,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:37,153 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 13:36:37,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:37,159 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 13:36:37,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 14090 backedges. 3717 proven. 320 refuted. 0 times theorem prover too weak. 10053 trivial. 0 not checked. [2018-11-10 13:36:37,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14090 backedges. 3717 proven. 320 refuted. 0 times theorem prover too weak. 10053 trivial. 0 not checked. [2018-11-10 13:36:38,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:38,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 47 [2018-11-10 13:36:38,419 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:38,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 13:36:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 13:36:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1923, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 13:36:38,420 INFO L87 Difference]: Start difference. First operand 481 states and 484 transitions. Second operand 34 states. [2018-11-10 13:36:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:39,744 INFO L93 Difference]: Finished difference Result 596 states and 604 transitions. [2018-11-10 13:36:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 13:36:39,744 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 516 [2018-11-10 13:36:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:39,746 INFO L225 Difference]: With dead ends: 596 [2018-11-10 13:36:39,746 INFO L226 Difference]: Without dead ends: 596 [2018-11-10 13:36:39,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 986 SyntacticMatches, 17 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=983, Invalid=5023, Unknown=0, NotChecked=0, Total=6006 [2018-11-10 13:36:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-11-10 13:36:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 560. [2018-11-10 13:36:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-11-10 13:36:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 565 transitions. [2018-11-10 13:36:39,753 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 565 transitions. Word has length 516 [2018-11-10 13:36:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:39,754 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 565 transitions. [2018-11-10 13:36:39,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 13:36:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 565 transitions. [2018-11-10 13:36:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-11-10 13:36:39,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:39,759 INFO L375 BasicCegarLoop]: trace histogram [86, 76, 76, 76, 75, 75, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:39,759 INFO L424 AbstractCegarLoop]: === Iteration 39 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:39,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash -882891034, now seen corresponding path program 20 times [2018-11-10 13:36:39,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:39,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:39,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:39,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:39,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19170 backedges. 10983 proven. 1017 refuted. 0 times theorem prover too weak. 7170 trivial. 0 not checked. [2018-11-10 13:36:40,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:40,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:40,330 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:40,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:40,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:40,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:40,339 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:40,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-10 13:36:40,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:40,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19170 backedges. 8114 proven. 994 refuted. 0 times theorem prover too weak. 10062 trivial. 0 not checked. [2018-11-10 13:36:41,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 19170 backedges. 8114 proven. 994 refuted. 0 times theorem prover too weak. 10062 trivial. 0 not checked. [2018-11-10 13:36:41,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 77 [2018-11-10 13:36:41,695 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:41,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-10 13:36:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-10 13:36:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=5059, Unknown=0, NotChecked=0, Total=5852 [2018-11-10 13:36:41,697 INFO L87 Difference]: Start difference. First operand 560 states and 565 transitions. Second operand 54 states. [2018-11-10 13:36:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:42,976 INFO L93 Difference]: Finished difference Result 580 states and 583 transitions. [2018-11-10 13:36:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-10 13:36:42,976 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 595 [2018-11-10 13:36:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:42,978 INFO L225 Difference]: With dead ends: 580 [2018-11-10 13:36:42,978 INFO L226 Difference]: Without dead ends: 574 [2018-11-10 13:36:42,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1138 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4820 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2588, Invalid=12912, Unknown=0, NotChecked=0, Total=15500 [2018-11-10 13:36:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-10 13:36:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 566. [2018-11-10 13:36:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-11-10 13:36:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 569 transitions. [2018-11-10 13:36:42,985 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 569 transitions. Word has length 595 [2018-11-10 13:36:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:42,986 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 569 transitions. [2018-11-10 13:36:42,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-10 13:36:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 569 transitions. [2018-11-10 13:36:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-11-10 13:36:42,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:42,988 INFO L375 BasicCegarLoop]: trace histogram [87, 77, 77, 77, 76, 76, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:42,988 INFO L424 AbstractCegarLoop]: === Iteration 40 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:42,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2105195503, now seen corresponding path program 21 times [2018-11-10 13:36:42,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:42,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:42,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 19645 backedges. 7337 proven. 1771 refuted. 0 times theorem prover too weak. 10537 trivial. 0 not checked. [2018-11-10 13:36:43,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:43,518 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:43,518 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:43,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:43,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:43,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:43,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:43,530 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:43,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:43,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:43,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:43,720 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 13:36:43,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,724 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 13:36:43,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19645 backedges. 4729 proven. 1524 refuted. 0 times theorem prover too weak. 13392 trivial. 0 not checked. [2018-11-10 13:36:44,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 19645 backedges. 4734 proven. 1519 refuted. 0 times theorem prover too weak. 13392 trivial. 0 not checked. [2018-11-10 13:36:45,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:45,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 21] total 67 [2018-11-10 13:36:45,542 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:45,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-10 13:36:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-10 13:36:45,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=4111, Unknown=0, NotChecked=0, Total=4556 [2018-11-10 13:36:45,543 INFO L87 Difference]: Start difference. First operand 566 states and 569 transitions. Second operand 48 states. [2018-11-10 13:36:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:48,137 INFO L93 Difference]: Finished difference Result 687 states and 695 transitions. [2018-11-10 13:36:48,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-10 13:36:48,137 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 601 [2018-11-10 13:36:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:48,139 INFO L225 Difference]: With dead ends: 687 [2018-11-10 13:36:48,139 INFO L226 Difference]: Without dead ends: 687 [2018-11-10 13:36:48,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1150 SyntacticMatches, 10 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2177, Invalid=11395, Unknown=0, NotChecked=0, Total=13572 [2018-11-10 13:36:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-10 13:36:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 651. [2018-11-10 13:36:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-10 13:36:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 656 transitions. [2018-11-10 13:36:48,145 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 656 transitions. Word has length 601 [2018-11-10 13:36:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:48,146 INFO L481 AbstractCegarLoop]: Abstraction has 651 states and 656 transitions. [2018-11-10 13:36:48,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-10 13:36:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 656 transitions. [2018-11-10 13:36:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2018-11-10 13:36:48,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:48,150 INFO L375 BasicCegarLoop]: trace histogram [100, 89, 89, 89, 88, 88, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:48,150 INFO L424 AbstractCegarLoop]: === Iteration 41 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:48,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:48,151 INFO L82 PathProgramCache]: Analyzing trace with hash -795116881, now seen corresponding path program 22 times [2018-11-10 13:36:48,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:48,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:48,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 26125 backedges. 11079 proven. 1890 refuted. 0 times theorem prover too weak. 13156 trivial. 0 not checked. [2018-11-10 13:36:48,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:48,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:48,612 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:48,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:48,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:48,613 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:48,621 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:48,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26125 backedges. 11257 proven. 352 refuted. 0 times theorem prover too weak. 14516 trivial. 0 not checked. [2018-11-10 13:36:49,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26125 backedges. 11257 proven. 352 refuted. 0 times theorem prover too weak. 14516 trivial. 0 not checked. [2018-11-10 13:36:49,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:49,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 55 [2018-11-10 13:36:49,581 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:49,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 13:36:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 13:36:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=2350, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 13:36:49,583 INFO L87 Difference]: Start difference. First operand 651 states and 656 transitions. Second operand 43 states. [2018-11-10 13:36:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:50,250 INFO L93 Difference]: Finished difference Result 671 states and 675 transitions. [2018-11-10 13:36:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 13:36:50,250 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 686 [2018-11-10 13:36:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:50,252 INFO L225 Difference]: With dead ends: 671 [2018-11-10 13:36:50,252 INFO L226 Difference]: Without dead ends: 665 [2018-11-10 13:36:50,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1428 GetRequests, 1336 SyntacticMatches, 13 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1514, Invalid=4966, Unknown=0, NotChecked=0, Total=6480 [2018-11-10 13:36:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-11-10 13:36:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 657. [2018-11-10 13:36:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-10 13:36:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 661 transitions. [2018-11-10 13:36:50,258 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 661 transitions. Word has length 686 [2018-11-10 13:36:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:50,259 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 661 transitions. [2018-11-10 13:36:50,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 13:36:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 661 transitions. [2018-11-10 13:36:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2018-11-10 13:36:50,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:50,263 INFO L375 BasicCegarLoop]: trace histogram [101, 90, 90, 90, 89, 89, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:50,263 INFO L424 AbstractCegarLoop]: === Iteration 42 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:50,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1870264456, now seen corresponding path program 23 times [2018-11-10 13:36:50,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:50,264 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 6226 proven. 456 refuted. 0 times theorem prover too weak. 19998 trivial. 0 not checked. [2018-11-10 13:36:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:50,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:50,792 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:50,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:50,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/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 13:36:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:50,801 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:50,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-10 13:36:50,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:50,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:50,973 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 13:36:50,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:50,981 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 13:36:50,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 9399 proven. 1349 refuted. 0 times theorem prover too weak. 15932 trivial. 0 not checked. [2018-11-10 13:36:52,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 6226 proven. 456 refuted. 0 times theorem prover too weak. 19998 trivial. 0 not checked. [2018-11-10 13:36:52,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:52,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 18] total 54 [2018-11-10 13:36:52,799 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:52,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-10 13:36:52,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-10 13:36:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2255, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 13:36:52,800 INFO L87 Difference]: Start difference. First operand 657 states and 661 transitions. Second operand 38 states. [2018-11-10 13:36:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:53,494 INFO L93 Difference]: Finished difference Result 695 states and 703 transitions. [2018-11-10 13:36:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 13:36:53,494 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 692 [2018-11-10 13:36:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:53,496 INFO L225 Difference]: With dead ends: 695 [2018-11-10 13:36:53,496 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 13:36:53,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1328 SyntacticMatches, 21 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1374, Invalid=3738, Unknown=0, NotChecked=0, Total=5112 [2018-11-10 13:36:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 13:36:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 663. [2018-11-10 13:36:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-11-10 13:36:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 668 transitions. [2018-11-10 13:36:53,502 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 668 transitions. Word has length 692 [2018-11-10 13:36:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:53,503 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 668 transitions. [2018-11-10 13:36:53,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-10 13:36:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 668 transitions. [2018-11-10 13:36:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-11-10 13:36:53,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:53,506 INFO L375 BasicCegarLoop]: trace histogram [102, 91, 91, 91, 90, 90, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:53,506 INFO L424 AbstractCegarLoop]: === Iteration 43 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:53,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash 20749391, now seen corresponding path program 24 times [2018-11-10 13:36:53,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:53,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:53,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 27241 backedges. 7205 proven. 456 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-11-10 13:36:54,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:54,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:54,169 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:54,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:54,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:54,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:36:54,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:36:54,177 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:36:54,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:36:54,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:54,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 27241 backedges. 7088 proven. 1723 refuted. 0 times theorem prover too weak. 18430 trivial. 0 not checked. [2018-11-10 13:36:54,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 27241 backedges. 7088 proven. 1723 refuted. 0 times theorem prover too weak. 18430 trivial. 0 not checked. [2018-11-10 13:36:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33, 33] total 52 [2018-11-10 13:36:55,173 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:55,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-10 13:36:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-10 13:36:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2156, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 13:36:55,174 INFO L87 Difference]: Start difference. First operand 663 states and 668 transitions. Second operand 49 states. [2018-11-10 13:36:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:55,849 INFO L93 Difference]: Finished difference Result 773 states and 779 transitions. [2018-11-10 13:36:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-10 13:36:55,850 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 698 [2018-11-10 13:36:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:55,852 INFO L225 Difference]: With dead ends: 773 [2018-11-10 13:36:55,852 INFO L226 Difference]: Without dead ends: 773 [2018-11-10 13:36:55,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1452 GetRequests, 1346 SyntacticMatches, 29 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1282, Invalid=4880, Unknown=0, NotChecked=0, Total=6162 [2018-11-10 13:36:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-11-10 13:36:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 760. [2018-11-10 13:36:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-11-10 13:36:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 766 transitions. [2018-11-10 13:36:55,858 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 766 transitions. Word has length 698 [2018-11-10 13:36:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:55,858 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 766 transitions. [2018-11-10 13:36:55,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-10 13:36:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 766 transitions. [2018-11-10 13:36:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-11-10 13:36:55,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:55,863 INFO L375 BasicCegarLoop]: trace histogram [115, 103, 103, 103, 102, 102, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:55,863 INFO L424 AbstractCegarLoop]: === Iteration 44 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:55,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash -178317027, now seen corresponding path program 25 times [2018-11-10 13:36:55,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:55,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:36:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:55,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34794 backedges. 18408 proven. 1437 refuted. 0 times theorem prover too weak. 14949 trivial. 0 not checked. [2018-11-10 13:36:56,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:56,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:56,467 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:56,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:56,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:56,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:36:56,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:56,473 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:56,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34794 backedges. 14250 proven. 420 refuted. 0 times theorem prover too weak. 20124 trivial. 0 not checked. [2018-11-10 13:36:57,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 34794 backedges. 14250 proven. 420 refuted. 0 times theorem prover too weak. 20124 trivial. 0 not checked. [2018-11-10 13:36:57,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:57,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 28] total 68 [2018-11-10 13:36:57,765 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:57,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 13:36:57,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 13:36:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=3759, Unknown=0, NotChecked=0, Total=4556 [2018-11-10 13:36:57,766 INFO L87 Difference]: Start difference. First operand 760 states and 766 transitions. Second operand 55 states. [2018-11-10 13:36:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:58,874 INFO L93 Difference]: Finished difference Result 773 states and 777 transitions. [2018-11-10 13:36:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-10 13:36:58,874 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 783 [2018-11-10 13:36:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:58,875 INFO L225 Difference]: With dead ends: 773 [2018-11-10 13:36:58,875 INFO L226 Difference]: Without dead ends: 767 [2018-11-10 13:36:58,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1635 GetRequests, 1518 SyntacticMatches, 14 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4358 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2046, Invalid=8874, Unknown=0, NotChecked=0, Total=10920 [2018-11-10 13:36:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-11-10 13:36:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 760. [2018-11-10 13:36:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-11-10 13:36:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 764 transitions. [2018-11-10 13:36:58,881 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 764 transitions. Word has length 783 [2018-11-10 13:36:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:58,882 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 764 transitions. [2018-11-10 13:36:58,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 13:36:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 764 transitions. [2018-11-10 13:36:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2018-11-10 13:36:58,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:58,885 INFO L375 BasicCegarLoop]: trace histogram [116, 104, 104, 104, 103, 103, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:58,885 INFO L424 AbstractCegarLoop]: === Iteration 45 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:36:58,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 120483302, now seen corresponding path program 26 times [2018-11-10 13:36:58,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:58,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:58,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:58,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 35435 backedges. 13354 proven. 1640 refuted. 0 times theorem prover too weak. 20441 trivial. 0 not checked. [2018-11-10 13:36:59,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:59,521 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:59,521 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:59,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:59,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:59,521 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:36:59,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:59,530 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:59,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-10 13:36:59,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:59,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:59,736 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 13:36:59,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:59,739 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 13:36:59,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:37:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 35435 backedges. 10034 proven. 1248 refuted. 0 times theorem prover too weak. 24153 trivial. 0 not checked. [2018-11-10 13:37:01,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35435 backedges. 7818 proven. 533 refuted. 0 times theorem prover too weak. 27084 trivial. 0 not checked. [2018-11-10 13:37:01,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:01,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 18] total 61 [2018-11-10 13:37:01,972 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:01,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-10 13:37:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 13:37:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=3131, Unknown=0, NotChecked=0, Total=3782 [2018-11-10 13:37:01,973 INFO L87 Difference]: Start difference. First operand 760 states and 764 transitions. Second operand 45 states. [2018-11-10 13:37:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:04,306 INFO L93 Difference]: Finished difference Result 886 states and 894 transitions. [2018-11-10 13:37:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 13:37:04,306 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 789 [2018-11-10 13:37:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:04,309 INFO L225 Difference]: With dead ends: 886 [2018-11-10 13:37:04,309 INFO L226 Difference]: Without dead ends: 886 [2018-11-10 13:37:04,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1655 GetRequests, 1520 SyntacticMatches, 23 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3440, Invalid=9442, Unknown=0, NotChecked=0, Total=12882 [2018-11-10 13:37:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-10 13:37:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 869. [2018-11-10 13:37:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-10 13:37:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 876 transitions. [2018-11-10 13:37:04,316 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 876 transitions. Word has length 789 [2018-11-10 13:37:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:04,317 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 876 transitions. [2018-11-10 13:37:04,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-10 13:37:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 876 transitions. [2018-11-10 13:37:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2018-11-10 13:37:04,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:04,322 INFO L375 BasicCegarLoop]: trace histogram [132, 119, 119, 119, 118, 118, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:04,322 INFO L424 AbstractCegarLoop]: === Iteration 46 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:04,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1902428687, now seen corresponding path program 27 times [2018-11-10 13:37:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:04,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:04,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 46168 backedges. 10233 proven. 627 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-11-10 13:37:05,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:05,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:05,242 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:05,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:05,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:05,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:05,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:37:05,248 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:37:05,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:37:05,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:37:05,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:05,483 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 13:37:05,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:05,501 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 13:37:05,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:37:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 46168 backedges. 9490 proven. 2370 refuted. 0 times theorem prover too weak. 34308 trivial. 0 not checked. [2018-11-10 13:37:07,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 46168 backedges. 9495 proven. 2365 refuted. 0 times theorem prover too weak. 34308 trivial. 0 not checked. [2018-11-10 13:37:08,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:08,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 26, 24] total 82 [2018-11-10 13:37:08,289 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:08,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-10 13:37:08,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-10 13:37:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=6041, Unknown=0, NotChecked=0, Total=6806 [2018-11-10 13:37:08,291 INFO L87 Difference]: Start difference. First operand 869 states and 876 transitions. Second operand 60 states. [2018-11-10 13:37:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:10,631 INFO L93 Difference]: Finished difference Result 1145 states and 1165 transitions. [2018-11-10 13:37:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-10 13:37:10,632 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 892 [2018-11-10 13:37:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:10,634 INFO L225 Difference]: With dead ends: 1145 [2018-11-10 13:37:10,634 INFO L226 Difference]: Without dead ends: 1145 [2018-11-10 13:37:10,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1856 GetRequests, 1723 SyntacticMatches, 13 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4212 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2025, Invalid=12737, Unknown=0, NotChecked=0, Total=14762 [2018-11-10 13:37:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-11-10 13:37:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 982. [2018-11-10 13:37:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-11-10 13:37:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 994 transitions. [2018-11-10 13:37:10,643 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 994 transitions. Word has length 892 [2018-11-10 13:37:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:10,643 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 994 transitions. [2018-11-10 13:37:10,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-10 13:37:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 994 transitions. [2018-11-10 13:37:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-11-10 13:37:10,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:10,649 INFO L375 BasicCegarLoop]: trace histogram [147, 133, 133, 133, 132, 132, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:10,649 INFO L424 AbstractCegarLoop]: === Iteration 47 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:10,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1031957565, now seen corresponding path program 28 times [2018-11-10 13:37:10,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:10,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:10,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 57499 backedges. 19603 proven. 4036 refuted. 0 times theorem prover too weak. 33860 trivial. 0 not checked. [2018-11-10 13:37:11,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:11,305 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:11,306 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:11,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:11,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:11,306 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:11,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:11,313 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:37:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:11,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 57499 backedges. 27758 proven. 494 refuted. 0 times theorem prover too weak. 29247 trivial. 0 not checked. [2018-11-10 13:37:12,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 57499 backedges. 19821 proven. 1645 refuted. 0 times theorem prover too weak. 36033 trivial. 0 not checked. [2018-11-10 13:37:12,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:12,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 30] total 63 [2018-11-10 13:37:12,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:12,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-10 13:37:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-10 13:37:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3087, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 13:37:12,797 INFO L87 Difference]: Start difference. First operand 982 states and 994 transitions. Second operand 49 states. [2018-11-10 13:37:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:13,633 INFO L93 Difference]: Finished difference Result 989 states and 996 transitions. [2018-11-10 13:37:13,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-10 13:37:13,633 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 989 [2018-11-10 13:37:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:13,636 INFO L225 Difference]: With dead ends: 989 [2018-11-10 13:37:13,636 INFO L226 Difference]: Without dead ends: 980 [2018-11-10 13:37:13,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2042 GetRequests, 1936 SyntacticMatches, 15 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2911 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2001, Invalid=6555, Unknown=0, NotChecked=0, Total=8556 [2018-11-10 13:37:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-11-10 13:37:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 966. [2018-11-10 13:37:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-11-10 13:37:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 973 transitions. [2018-11-10 13:37:13,643 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 973 transitions. Word has length 989 [2018-11-10 13:37:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:13,644 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 973 transitions. [2018-11-10 13:37:13,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-10 13:37:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 973 transitions. [2018-11-10 13:37:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-11-10 13:37:13,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:13,650 INFO L375 BasicCegarLoop]: trace histogram [148, 134, 134, 134, 133, 133, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:13,650 INFO L424 AbstractCegarLoop]: === Iteration 48 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:13,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash -108591212, now seen corresponding path program 29 times [2018-11-10 13:37:13,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:13,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 58324 backedges. 28581 proven. 1929 refuted. 0 times theorem prover too weak. 27814 trivial. 0 not checked. [2018-11-10 13:37:14,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:14,454 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:14,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:14,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:14,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:14,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:14,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:37:14,464 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:37:14,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-10 13:37:14,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:37:14,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 58324 backedges. 20524 proven. 1894 refuted. 0 times theorem prover too weak. 35906 trivial. 0 not checked. [2018-11-10 13:37:15,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 58324 backedges. 20524 proven. 1894 refuted. 0 times theorem prover too weak. 35906 trivial. 0 not checked. [2018-11-10 13:37:16,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:16,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 37] total 101 [2018-11-10 13:37:16,780 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:16,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-10 13:37:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-10 13:37:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1373, Invalid=8727, Unknown=0, NotChecked=0, Total=10100 [2018-11-10 13:37:16,781 INFO L87 Difference]: Start difference. First operand 966 states and 973 transitions. Second operand 70 states. [2018-11-10 13:37:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:18,845 INFO L93 Difference]: Finished difference Result 1105 states and 1112 transitions. [2018-11-10 13:37:18,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-10 13:37:18,845 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 995 [2018-11-10 13:37:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:18,848 INFO L225 Difference]: With dead ends: 1105 [2018-11-10 13:37:18,848 INFO L226 Difference]: Without dead ends: 1099 [2018-11-10 13:37:18,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2091 GetRequests, 1922 SyntacticMatches, 5 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8824 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4508, Invalid=22882, Unknown=0, NotChecked=0, Total=27390 [2018-11-10 13:37:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-11-10 13:37:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1084. [2018-11-10 13:37:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-11-10 13:37:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1090 transitions. [2018-11-10 13:37:18,857 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1090 transitions. Word has length 995 [2018-11-10 13:37:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:18,858 INFO L481 AbstractCegarLoop]: Abstraction has 1084 states and 1090 transitions. [2018-11-10 13:37:18,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-10 13:37:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1090 transitions. [2018-11-10 13:37:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-11-10 13:37:18,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:18,863 INFO L375 BasicCegarLoop]: trace histogram [149, 135, 135, 135, 134, 134, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:18,863 INFO L424 AbstractCegarLoop]: === Iteration 49 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:18,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -624071651, now seen corresponding path program 30 times [2018-11-10 13:37:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:18,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:18,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:18,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 59155 backedges. 12427 proven. 724 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-11-10 13:37:19,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:19,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:19,933 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:19,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:19,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:19,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:19,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:37:19,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:37:20,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:37:20,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:37:20,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:20,199 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 13:37:20,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:20,206 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 13:37:20,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:37:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 59155 backedges. 11587 proven. 2692 refuted. 0 times theorem prover too weak. 44876 trivial. 0 not checked. [2018-11-10 13:37:22,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 59155 backedges. 11592 proven. 2687 refuted. 0 times theorem prover too weak. 44876 trivial. 0 not checked. [2018-11-10 13:37:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:23,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 27, 25] total 86 [2018-11-10 13:37:23,580 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:23,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-10 13:37:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-10 13:37:23,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=6640, Unknown=0, NotChecked=0, Total=7482 [2018-11-10 13:37:23,581 INFO L87 Difference]: Start difference. First operand 1084 states and 1090 transitions. Second operand 63 states. [2018-11-10 13:37:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:26,306 INFO L93 Difference]: Finished difference Result 1233 states and 1244 transitions. [2018-11-10 13:37:26,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-10 13:37:26,306 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1001 [2018-11-10 13:37:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:26,308 INFO L225 Difference]: With dead ends: 1233 [2018-11-10 13:37:26,308 INFO L226 Difference]: Without dead ends: 1233 [2018-11-10 13:37:26,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2078 GetRequests, 1938 SyntacticMatches, 14 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4666 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2215, Invalid=14041, Unknown=0, NotChecked=0, Total=16256 [2018-11-10 13:37:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-11-10 13:37:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1193. [2018-11-10 13:37:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-10 13:37:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1201 transitions. [2018-11-10 13:37:26,317 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1201 transitions. Word has length 1001 [2018-11-10 13:37:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:26,318 INFO L481 AbstractCegarLoop]: Abstraction has 1193 states and 1201 transitions. [2018-11-10 13:37:26,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-10 13:37:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1201 transitions. [2018-11-10 13:37:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2018-11-10 13:37:26,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:26,327 INFO L375 BasicCegarLoop]: trace histogram [166, 151, 151, 151, 150, 150, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:26,327 INFO L424 AbstractCegarLoop]: === Iteration 50 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:26,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash -245703651, now seen corresponding path program 31 times [2018-11-10 13:37:26,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:26,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:26,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 73755 backedges. 26019 proven. 3402 refuted. 0 times theorem prover too weak. 44334 trivial. 0 not checked. [2018-11-10 13:37:27,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:27,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:27,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:27,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:27,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:27,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:27,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:27,144 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:37:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:27,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 73755 backedges. 26277 proven. 660 refuted. 0 times theorem prover too weak. 46818 trivial. 0 not checked. [2018-11-10 13:37:27,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 73755 backedges. 26277 proven. 660 refuted. 0 times theorem prover too weak. 46818 trivial. 0 not checked. [2018-11-10 13:37:28,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:28,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 71 [2018-11-10 13:37:28,932 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:28,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 13:37:28,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 13:37:28,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1046, Invalid=3924, Unknown=0, NotChecked=0, Total=4970 [2018-11-10 13:37:28,934 INFO L87 Difference]: Start difference. First operand 1193 states and 1201 transitions. Second operand 55 states. [2018-11-10 13:37:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:29,877 INFO L93 Difference]: Finished difference Result 1229 states and 1237 transitions. [2018-11-10 13:37:29,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-10 13:37:29,878 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 1110 [2018-11-10 13:37:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:29,879 INFO L225 Difference]: With dead ends: 1229 [2018-11-10 13:37:29,879 INFO L226 Difference]: Without dead ends: 1223 [2018-11-10 13:37:29,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2292 GetRequests, 2172 SyntacticMatches, 17 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3794 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2556, Invalid=8364, Unknown=0, NotChecked=0, Total=10920 [2018-11-10 13:37:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2018-11-10 13:37:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1199. [2018-11-10 13:37:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-11-10 13:37:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1206 transitions. [2018-11-10 13:37:29,886 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1206 transitions. Word has length 1110 [2018-11-10 13:37:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:29,887 INFO L481 AbstractCegarLoop]: Abstraction has 1199 states and 1206 transitions. [2018-11-10 13:37:29,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 13:37:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1206 transitions. [2018-11-10 13:37:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-11-10 13:37:29,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:29,892 INFO L375 BasicCegarLoop]: trace histogram [167, 152, 152, 152, 151, 151, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:29,892 INFO L424 AbstractCegarLoop]: === Iteration 51 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:29,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1466837094, now seen corresponding path program 32 times [2018-11-10 13:37:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:29,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 74690 backedges. 14160 proven. 800 refuted. 0 times theorem prover too weak. 59730 trivial. 0 not checked. [2018-11-10 13:37:30,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:30,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:30,933 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:30,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:30,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:30,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:30,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:37:30,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:37:31,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-10 13:37:31,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:37:31,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:31,226 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 13:37:31,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:31,235 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 13:37:31,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:37:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 74690 backedges. 19496 proven. 4344 refuted. 0 times theorem prover too weak. 50850 trivial. 0 not checked. [2018-11-10 13:37:33,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 74690 backedges. 14160 proven. 800 refuted. 0 times theorem prover too weak. 59730 trivial. 0 not checked. [2018-11-10 13:37:34,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:34,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 21] total 63 [2018-11-10 13:37:34,846 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:34,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-10 13:37:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 13:37:34,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 13:37:34,847 INFO L87 Difference]: Start difference. First operand 1199 states and 1206 transitions. Second operand 44 states. [2018-11-10 13:37:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:36,141 INFO L93 Difference]: Finished difference Result 1268 states and 1282 transitions. [2018-11-10 13:37:36,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 13:37:36,141 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1116 [2018-11-10 13:37:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:36,144 INFO L225 Difference]: With dead ends: 1268 [2018-11-10 13:37:36,144 INFO L226 Difference]: Without dead ends: 1268 [2018-11-10 13:37:36,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2275 GetRequests, 2162 SyntacticMatches, 30 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1897, Invalid=5243, Unknown=0, NotChecked=0, Total=7140 [2018-11-10 13:37:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2018-11-10 13:37:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1205. [2018-11-10 13:37:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-11-10 13:37:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1213 transitions. [2018-11-10 13:37:36,153 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1213 transitions. Word has length 1116 [2018-11-10 13:37:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:36,153 INFO L481 AbstractCegarLoop]: Abstraction has 1205 states and 1213 transitions. [2018-11-10 13:37:36,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-10 13:37:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1213 transitions. [2018-11-10 13:37:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2018-11-10 13:37:36,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:36,160 INFO L375 BasicCegarLoop]: trace histogram [168, 153, 153, 153, 152, 152, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:36,160 INFO L424 AbstractCegarLoop]: === Iteration 52 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:36,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -275262787, now seen corresponding path program 33 times [2018-11-10 13:37:36,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:36,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:36,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 75631 backedges. 15851 proven. 830 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-11-10 13:37:36,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:36,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:36,936 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:36,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:36,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:36,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:36,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:37:36,945 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:37:37,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:37:37,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:37:37,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 75631 backedges. 15702 proven. 2977 refuted. 0 times theorem prover too weak. 56952 trivial. 0 not checked. [2018-11-10 13:37:37,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 75631 backedges. 15702 proven. 2977 refuted. 0 times theorem prover too weak. 56952 trivial. 0 not checked. [2018-11-10 13:37:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:38,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41, 41] total 64 [2018-11-10 13:37:38,720 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:38,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-10 13:37:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-10 13:37:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=3260, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 13:37:38,722 INFO L87 Difference]: Start difference. First operand 1205 states and 1213 transitions. Second operand 61 states. [2018-11-10 13:37:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:39,806 INFO L93 Difference]: Finished difference Result 1360 states and 1370 transitions. [2018-11-10 13:37:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 13:37:39,806 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1122 [2018-11-10 13:37:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:39,808 INFO L225 Difference]: With dead ends: 1360 [2018-11-10 13:37:39,808 INFO L226 Difference]: Without dead ends: 1360 [2018-11-10 13:37:39,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2316 GetRequests, 2182 SyntacticMatches, 37 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3181 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2058, Invalid=7644, Unknown=0, NotChecked=0, Total=9702 [2018-11-10 13:37:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2018-11-10 13:37:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1338. [2018-11-10 13:37:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2018-11-10 13:37:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1348 transitions. [2018-11-10 13:37:39,816 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1348 transitions. Word has length 1122 [2018-11-10 13:37:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:39,817 INFO L481 AbstractCegarLoop]: Abstraction has 1338 states and 1348 transitions. [2018-11-10 13:37:39,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-10 13:37:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1348 transitions. [2018-11-10 13:37:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1232 [2018-11-10 13:37:39,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:39,828 INFO L375 BasicCegarLoop]: trace histogram [185, 169, 169, 169, 168, 168, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:39,828 INFO L424 AbstractCegarLoop]: === Iteration 53 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:39,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1586220469, now seen corresponding path program 34 times [2018-11-10 13:37:39,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:39,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:39,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 92040 backedges. 41934 proven. 2493 refuted. 0 times theorem prover too weak. 47613 trivial. 0 not checked. [2018-11-10 13:37:40,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:40,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:40,836 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:40,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:40,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:40,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:40,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:40,845 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:37:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:41,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 92040 backedges. 31422 proven. 752 refuted. 0 times theorem prover too weak. 59866 trivial. 0 not checked. [2018-11-10 13:37:42,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 92040 backedges. 31422 proven. 752 refuted. 0 times theorem prover too weak. 59866 trivial. 0 not checked. [2018-11-10 13:37:43,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:43,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 36] total 88 [2018-11-10 13:37:43,201 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:43,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-10 13:37:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-10 13:37:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1313, Invalid=6343, Unknown=0, NotChecked=0, Total=7656 [2018-11-10 13:37:43,202 INFO L87 Difference]: Start difference. First operand 1338 states and 1348 transitions. Second operand 71 states. [2018-11-10 13:37:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:44,933 INFO L93 Difference]: Finished difference Result 1371 states and 1380 transitions. [2018-11-10 13:37:44,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-10 13:37:44,933 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1231 [2018-11-10 13:37:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:44,936 INFO L225 Difference]: With dead ends: 1371 [2018-11-10 13:37:44,936 INFO L226 Difference]: Without dead ends: 1365 [2018-11-10 13:37:44,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2551 GetRequests, 2398 SyntacticMatches, 18 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7802 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3392, Invalid=15240, Unknown=0, NotChecked=0, Total=18632 [2018-11-10 13:37:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2018-11-10 13:37:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1351. [2018-11-10 13:37:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2018-11-10 13:37:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1360 transitions. [2018-11-10 13:37:44,945 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1360 transitions. Word has length 1231 [2018-11-10 13:37:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:44,946 INFO L481 AbstractCegarLoop]: Abstraction has 1351 states and 1360 transitions. [2018-11-10 13:37:44,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-10 13:37:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1360 transitions. [2018-11-10 13:37:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2018-11-10 13:37:44,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:44,957 INFO L375 BasicCegarLoop]: trace histogram [186, 170, 170, 170, 169, 169, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:44,957 INFO L424 AbstractCegarLoop]: === Iteration 54 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:44,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1594095252, now seen corresponding path program 35 times [2018-11-10 13:37:44,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:44,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:44,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:44,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:44,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 93085 backedges. 16856 proven. 901 refuted. 0 times theorem prover too weak. 75328 trivial. 0 not checked. [2018-11-10 13:37:46,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:46,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:46,082 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:46,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:46,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:46,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:46,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:37:46,091 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:37:46,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-10 13:37:46,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:37:46,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:46,384 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 13:37:46,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,390 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 13:37:46,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:37:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 93085 backedges. 16856 proven. 901 refuted. 0 times theorem prover too weak. 75328 trivial. 0 not checked. [2018-11-10 13:37:48,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 93085 backedges. 16856 proven. 901 refuted. 0 times theorem prover too weak. 75328 trivial. 0 not checked. [2018-11-10 13:37:50,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:50,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 66 [2018-11-10 13:37:50,375 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:50,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-10 13:37:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-10 13:37:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1452, Invalid=2970, Unknown=0, NotChecked=0, Total=4422 [2018-11-10 13:37:50,376 INFO L87 Difference]: Start difference. First operand 1351 states and 1360 transitions. Second operand 46 states. [2018-11-10 13:37:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:51,144 INFO L93 Difference]: Finished difference Result 1376 states and 1387 transitions. [2018-11-10 13:37:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 13:37:51,144 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1237 [2018-11-10 13:37:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:51,146 INFO L225 Difference]: With dead ends: 1376 [2018-11-10 13:37:51,146 INFO L226 Difference]: Without dead ends: 1376 [2018-11-10 13:37:51,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2517 GetRequests, 2400 SyntacticMatches, 31 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2574, Invalid=5082, Unknown=0, NotChecked=0, Total=7656 [2018-11-10 13:37:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-11-10 13:37:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1357. [2018-11-10 13:37:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-11-10 13:37:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1367 transitions. [2018-11-10 13:37:51,156 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1367 transitions. Word has length 1237 [2018-11-10 13:37:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:51,156 INFO L481 AbstractCegarLoop]: Abstraction has 1357 states and 1367 transitions. [2018-11-10 13:37:51,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-10 13:37:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1367 transitions. [2018-11-10 13:37:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1244 [2018-11-10 13:37:51,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:51,163 INFO L375 BasicCegarLoop]: trace histogram [187, 171, 171, 171, 170, 170, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:51,163 INFO L424 AbstractCegarLoop]: === Iteration 55 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:51,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash -126237077, now seen corresponding path program 36 times [2018-11-10 13:37:51,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:51,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:51,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:51,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:51,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 94136 backedges. 18755 proven. 941 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-11-10 13:37:52,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:52,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:52,058 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:52,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:52,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:52,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:52,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:37:52,066 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:37:52,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:37:52,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:37:52,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 94136 backedges. 18598 proven. 3343 refuted. 0 times theorem prover too weak. 72195 trivial. 0 not checked. [2018-11-10 13:37:53,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 94136 backedges. 18598 proven. 3343 refuted. 0 times theorem prover too weak. 72195 trivial. 0 not checked. [2018-11-10 13:37:54,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:54,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43, 43] total 67 [2018-11-10 13:37:54,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:54,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-10 13:37:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-10 13:37:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=3571, Unknown=0, NotChecked=0, Total=4422 [2018-11-10 13:37:54,102 INFO L87 Difference]: Start difference. First operand 1357 states and 1367 transitions. Second operand 64 states. [2018-11-10 13:37:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:55,162 INFO L93 Difference]: Finished difference Result 1494 states and 1505 transitions. [2018-11-10 13:37:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-10 13:37:55,163 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1243 [2018-11-10 13:37:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:55,165 INFO L225 Difference]: With dead ends: 1494 [2018-11-10 13:37:55,165 INFO L226 Difference]: Without dead ends: 1494 [2018-11-10 13:37:55,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2562 GetRequests, 2421 SyntacticMatches, 39 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3513 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2282, Invalid=8430, Unknown=0, NotChecked=0, Total=10712 [2018-11-10 13:37:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-11-10 13:37:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1478. [2018-11-10 13:37:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-11-10 13:37:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1489 transitions. [2018-11-10 13:37:55,175 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1489 transitions. Word has length 1243 [2018-11-10 13:37:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:55,176 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 1489 transitions. [2018-11-10 13:37:55,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-10 13:37:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1489 transitions. [2018-11-10 13:37:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2018-11-10 13:37:55,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:55,187 INFO L375 BasicCegarLoop]: trace histogram [205, 188, 188, 188, 187, 187, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:55,187 INFO L424 AbstractCegarLoop]: === Iteration 56 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:55,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:55,187 INFO L82 PathProgramCache]: Analyzing trace with hash -95377804, now seen corresponding path program 37 times [2018-11-10 13:37:55,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:55,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:37:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:55,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 113509 backedges. 36897 proven. 4314 refuted. 0 times theorem prover too weak. 72298 trivial. 0 not checked. [2018-11-10 13:37:56,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:56,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:37:56,285 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:37:56,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:37:56,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:37:56,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:37:56,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:56,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:37:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:56,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 113509 backedges. 37195 proven. 850 refuted. 0 times theorem prover too weak. 75464 trivial. 0 not checked. [2018-11-10 13:37:57,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 113509 backedges. 37195 proven. 850 refuted. 0 times theorem prover too weak. 75464 trivial. 0 not checked. [2018-11-10 13:37:58,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:37:58,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 38] total 79 [2018-11-10 13:37:58,600 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:37:58,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-10 13:37:58,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-10 13:37:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1301, Invalid=4861, Unknown=0, NotChecked=0, Total=6162 [2018-11-10 13:37:58,601 INFO L87 Difference]: Start difference. First operand 1478 states and 1489 transitions. Second operand 61 states. [2018-11-10 13:37:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:59,763 INFO L93 Difference]: Finished difference Result 1494 states and 1503 transitions. [2018-11-10 13:37:59,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-10 13:37:59,764 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1358 [2018-11-10 13:37:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:59,767 INFO L225 Difference]: With dead ends: 1494 [2018-11-10 13:37:59,767 INFO L226 Difference]: Without dead ends: 1488 [2018-11-10 13:37:59,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2796 GetRequests, 2662 SyntacticMatches, 19 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4793 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3179, Invalid=10393, Unknown=0, NotChecked=0, Total=13572 [2018-11-10 13:37:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2018-11-10 13:37:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1478. [2018-11-10 13:37:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-11-10 13:37:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1487 transitions. [2018-11-10 13:37:59,777 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1487 transitions. Word has length 1358 [2018-11-10 13:37:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:59,778 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 1487 transitions. [2018-11-10 13:37:59,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-10 13:37:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1487 transitions. [2018-11-10 13:37:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1365 [2018-11-10 13:37:59,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:59,787 INFO L375 BasicCegarLoop]: trace histogram [206, 189, 189, 189, 188, 188, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:59,787 INFO L424 AbstractCegarLoop]: === Iteration 57 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:37:59,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:59,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1160206973, now seen corresponding path program 38 times [2018-11-10 13:37:59,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:37:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:59,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:37:59,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:37:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 114670 backedges. 20059 proven. 1057 refuted. 0 times theorem prover too weak. 93554 trivial. 0 not checked. [2018-11-10 13:38:01,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:01,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:38:01,218 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:38:01,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:38:01,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:01,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:01,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:38:01,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:38:01,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-10 13:38:01,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:38:01,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:01,588 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 13:38:01,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:01,592 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 13:38:01,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 114670 backedges. 31938 proven. 2980 refuted. 0 times theorem prover too weak. 79752 trivial. 0 not checked. [2018-11-10 13:38:04,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 114670 backedges. 19873 proven. 1008 refuted. 0 times theorem prover too weak. 93789 trivial. 0 not checked. [2018-11-10 13:38:06,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:38:06,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 23] total 72 [2018-11-10 13:38:06,279 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:38:06,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-10 13:38:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-10 13:38:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1096, Invalid=4160, Unknown=0, NotChecked=0, Total=5256 [2018-11-10 13:38:06,281 INFO L87 Difference]: Start difference. First operand 1478 states and 1487 transitions. Second operand 51 states. [2018-11-10 13:38:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:08,591 INFO L93 Difference]: Finished difference Result 1637 states and 1650 transitions. [2018-11-10 13:38:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-10 13:38:08,592 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1364 [2018-11-10 13:38:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:08,594 INFO L225 Difference]: With dead ends: 1637 [2018-11-10 13:38:08,594 INFO L226 Difference]: Without dead ends: 1637 [2018-11-10 13:38:08,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2798 GetRequests, 2650 SyntacticMatches, 33 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3386, Invalid=10186, Unknown=0, NotChecked=0, Total=13572 [2018-11-10 13:38:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-11-10 13:38:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1605. [2018-11-10 13:38:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-11-10 13:38:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1616 transitions. [2018-11-10 13:38:08,606 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1616 transitions. Word has length 1364 [2018-11-10 13:38:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:08,606 INFO L481 AbstractCegarLoop]: Abstraction has 1605 states and 1616 transitions. [2018-11-10 13:38:08,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-10 13:38:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1616 transitions. [2018-11-10 13:38:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1492 [2018-11-10 13:38:08,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:08,615 INFO L375 BasicCegarLoop]: trace histogram [226, 208, 208, 208, 207, 207, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:08,615 INFO L424 AbstractCegarLoop]: === Iteration 58 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:38:08,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash -542074558, now seen corresponding path program 39 times [2018-11-10 13:38:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:38:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:08,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:38:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:08,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:38:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 138510 backedges. 58899 proven. 3129 refuted. 0 times theorem prover too weak. 76482 trivial. 0 not checked. [2018-11-10 13:38:09,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:09,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:38:09,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:38:09,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:38:09,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:09,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:38:09,946 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:38:10,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:38:10,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:38:10,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 138510 backedges. 43373 proven. 3719 refuted. 0 times theorem prover too weak. 91418 trivial. 0 not checked. [2018-11-10 13:38:11,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 138510 backedges. 43381 proven. 3711 refuted. 0 times theorem prover too weak. 91418 trivial. 0 not checked. [2018-11-10 13:38:13,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:38:13,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 103 [2018-11-10 13:38:13,064 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:38:13,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-11-10 13:38:13,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-11-10 13:38:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1679, Invalid=8827, Unknown=0, NotChecked=0, Total=10506 [2018-11-10 13:38:13,066 INFO L87 Difference]: Start difference. First operand 1605 states and 1616 transitions. Second operand 82 states. [2018-11-10 13:38:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:14,896 INFO L93 Difference]: Finished difference Result 1631 states and 1641 transitions. [2018-11-10 13:38:14,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-10 13:38:14,896 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 1491 [2018-11-10 13:38:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:14,900 INFO L225 Difference]: With dead ends: 1631 [2018-11-10 13:38:14,901 INFO L226 Difference]: Without dead ends: 1625 [2018-11-10 13:38:14,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3081 GetRequests, 2903 SyntacticMatches, 22 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10659 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4524, Invalid=20282, Unknown=0, NotChecked=0, Total=24806 [2018-11-10 13:38:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-11-10 13:38:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1611. [2018-11-10 13:38:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-11-10 13:38:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 1621 transitions. [2018-11-10 13:38:14,915 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 1621 transitions. Word has length 1491 [2018-11-10 13:38:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:14,916 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 1621 transitions. [2018-11-10 13:38:14,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-11-10 13:38:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1621 transitions. [2018-11-10 13:38:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1498 [2018-11-10 13:38:14,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:14,926 INFO L375 BasicCegarLoop]: trace histogram [227, 209, 209, 209, 208, 208, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:14,926 INFO L424 AbstractCegarLoop]: === Iteration 59 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:38:14,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash -904131253, now seen corresponding path program 40 times [2018-11-10 13:38:14,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:38:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:14,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:38:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:14,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:38:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 139793 backedges. 38949 proven. 5331 refuted. 0 times theorem prover too weak. 95513 trivial. 0 not checked. [2018-11-10 13:38:16,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:16,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:38:16,550 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:38:16,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:38:16,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:16,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:16,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:16,560 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:38:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:16,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:16,905 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 13:38:16,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:16,911 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 13:38:16,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 139793 backedges. 23229 proven. 1121 refuted. 0 times theorem prover too weak. 115443 trivial. 0 not checked. [2018-11-10 13:38:20,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 139793 backedges. 23229 proven. 1121 refuted. 0 times theorem prover too weak. 115443 trivial. 0 not checked. [2018-11-10 13:38:21,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:38:21,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25, 24] total 80 [2018-11-10 13:38:21,873 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:38:21,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-10 13:38:21,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-10 13:38:21,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=5700, Unknown=0, NotChecked=0, Total=6480 [2018-11-10 13:38:21,874 INFO L87 Difference]: Start difference. First operand 1611 states and 1621 transitions. Second operand 58 states. [2018-11-10 13:38:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:25,878 INFO L93 Difference]: Finished difference Result 1805 states and 1822 transitions. [2018-11-10 13:38:25,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-10 13:38:25,878 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1497 [2018-11-10 13:38:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:25,883 INFO L225 Difference]: With dead ends: 1805 [2018-11-10 13:38:25,883 INFO L226 Difference]: Without dead ends: 1805 [2018-11-10 13:38:25,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3094 GetRequests, 2912 SyntacticMatches, 35 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6030 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3500, Invalid=18552, Unknown=0, NotChecked=0, Total=22052 [2018-11-10 13:38:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-11-10 13:38:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1744. [2018-11-10 13:38:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2018-11-10 13:38:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 1756 transitions. [2018-11-10 13:38:25,895 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 1756 transitions. Word has length 1497 [2018-11-10 13:38:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:25,896 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 1756 transitions. [2018-11-10 13:38:25,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-10 13:38:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 1756 transitions. [2018-11-10 13:38:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1631 [2018-11-10 13:38:25,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:25,908 INFO L375 BasicCegarLoop]: trace histogram [248, 229, 229, 229, 228, 228, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:25,908 INFO L424 AbstractCegarLoop]: === Iteration 60 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:38:25,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1618940789, now seen corresponding path program 41 times [2018-11-10 13:38:25,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:38:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:25,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:25,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:38:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 167409 backedges. 50431 proven. 5330 refuted. 0 times theorem prover too weak. 111648 trivial. 0 not checked. [2018-11-10 13:38:27,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:27,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:38:27,338 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:38:27,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:38:27,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:27,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:27,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:38:27,347 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:38:27,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-10 13:38:27,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:38:27,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 167409 backedges. 48524 proven. 3424 refuted. 0 times theorem prover too weak. 115461 trivial. 0 not checked. [2018-11-10 13:38:29,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 167409 backedges. 48524 proven. 3424 refuted. 0 times theorem prover too weak. 115461 trivial. 0 not checked. [2018-11-10 13:38:31,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:38:31,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 131 [2018-11-10 13:38:31,629 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:38:31,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-10 13:38:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-10 13:38:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=14723, Unknown=0, NotChecked=0, Total=17030 [2018-11-10 13:38:31,631 INFO L87 Difference]: Start difference. First operand 1744 states and 1756 transitions. Second operand 90 states. [2018-11-10 13:38:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:34,658 INFO L93 Difference]: Finished difference Result 1919 states and 1930 transitions. [2018-11-10 13:38:34,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-11-10 13:38:34,658 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1630 [2018-11-10 13:38:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:34,662 INFO L225 Difference]: With dead ends: 1919 [2018-11-10 13:38:34,662 INFO L226 Difference]: Without dead ends: 1910 [2018-11-10 13:38:34,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3407 GetRequests, 3172 SyntacticMatches, 5 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18647 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7481, Invalid=46111, Unknown=0, NotChecked=0, Total=53592 [2018-11-10 13:38:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2018-11-10 13:38:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1892. [2018-11-10 13:38:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2018-11-10 13:38:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 1903 transitions. [2018-11-10 13:38:34,676 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 1903 transitions. Word has length 1630 [2018-11-10 13:38:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:34,677 INFO L481 AbstractCegarLoop]: Abstraction has 1892 states and 1903 transitions. [2018-11-10 13:38:34,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-11-10 13:38:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 1903 transitions. [2018-11-10 13:38:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1637 [2018-11-10 13:38:34,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:34,687 INFO L375 BasicCegarLoop]: trace histogram [249, 230, 230, 230, 229, 229, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:34,688 INFO L424 AbstractCegarLoop]: === Iteration 61 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:38:34,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash 884979796, now seen corresponding path program 42 times [2018-11-10 13:38:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:38:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:34,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:38:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:34,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:38:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 168820 backedges. 26942 proven. 1240 refuted. 0 times theorem prover too weak. 140638 trivial. 0 not checked. [2018-11-10 13:38:36,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:36,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:38:36,554 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:38:36,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:38:36,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:36,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:36,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:38:36,565 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:38:36,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:38:36,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:38:37,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:37,017 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 13:38:37,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:37,022 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 13:38:37,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 168820 backedges. 26707 proven. 4602 refuted. 0 times theorem prover too weak. 137511 trivial. 0 not checked. [2018-11-10 13:38:41,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 168820 backedges. 26712 proven. 4597 refuted. 0 times theorem prover too weak. 137511 trivial. 0 not checked. [2018-11-10 13:38:43,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:38:43,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 32, 30] total 86 [2018-11-10 13:38:43,171 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:38:43,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-10 13:38:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-10 13:38:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=892, Invalid=6590, Unknown=0, NotChecked=0, Total=7482 [2018-11-10 13:38:43,173 INFO L87 Difference]: Start difference. First operand 1892 states and 1903 transitions. Second operand 58 states. [2018-11-10 13:38:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:45,922 INFO L93 Difference]: Finished difference Result 1936 states and 1951 transitions. [2018-11-10 13:38:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 13:38:45,922 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1636 [2018-11-10 13:38:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:45,926 INFO L225 Difference]: With dead ends: 1936 [2018-11-10 13:38:45,927 INFO L226 Difference]: Without dead ends: 1936 [2018-11-10 13:38:45,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3323 GetRequests, 3193 SyntacticMatches, 19 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3256 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2026, Invalid=10630, Unknown=0, NotChecked=0, Total=12656 [2018-11-10 13:38:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-11-10 13:38:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1898. [2018-11-10 13:38:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2018-11-10 13:38:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 1910 transitions. [2018-11-10 13:38:45,939 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 1910 transitions. Word has length 1636 [2018-11-10 13:38:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:45,940 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 1910 transitions. [2018-11-10 13:38:45,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-10 13:38:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 1910 transitions. [2018-11-10 13:38:45,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1643 [2018-11-10 13:38:45,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:45,953 INFO L375 BasicCegarLoop]: trace histogram [250, 231, 231, 231, 230, 230, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:45,953 INFO L424 AbstractCegarLoop]: === Iteration 62 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:38:45,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1790101461, now seen corresponding path program 43 times [2018-11-10 13:38:45,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:38:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:45,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:38:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:45,954 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:38:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 170237 backedges. 29537 proven. 1316 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-11-10 13:38:47,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:47,339 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:38:47,340 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:38:47,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:38:47,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:47,340 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:47,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:47,350 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:38:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:47,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 170237 backedges. 29599 proven. 1254 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-11-10 13:38:49,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 170237 backedges. 29599 proven. 1254 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-11-10 13:38:50,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:38:50,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 69 [2018-11-10 13:38:50,190 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:38:50,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-10 13:38:50,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-10 13:38:50,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=3610, Unknown=0, NotChecked=0, Total=4692 [2018-11-10 13:38:50,191 INFO L87 Difference]: Start difference. First operand 1898 states and 1910 transitions. Second operand 69 states. [2018-11-10 13:38:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:51,279 INFO L93 Difference]: Finished difference Result 2062 states and 2075 transitions. [2018-11-10 13:38:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-10 13:38:51,279 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1642 [2018-11-10 13:38:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:51,282 INFO L225 Difference]: With dead ends: 2062 [2018-11-10 13:38:51,282 INFO L226 Difference]: Without dead ends: 2062 [2018-11-10 13:38:51,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3370 GetRequests, 3219 SyntacticMatches, 43 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3747 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3047, Invalid=8943, Unknown=0, NotChecked=0, Total=11990 [2018-11-10 13:38:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2018-11-10 13:38:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2043. [2018-11-10 13:38:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2018-11-10 13:38:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2056 transitions. [2018-11-10 13:38:51,296 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2056 transitions. Word has length 1642 [2018-11-10 13:38:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:51,296 INFO L481 AbstractCegarLoop]: Abstraction has 2043 states and 2056 transitions. [2018-11-10 13:38:51,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-10 13:38:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2056 transitions. [2018-11-10 13:38:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1776 [2018-11-10 13:38:51,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:51,308 INFO L375 BasicCegarLoop]: trace histogram [271, 251, 251, 251, 250, 250, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:51,309 INFO L424 AbstractCegarLoop]: === Iteration 63 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:38:51,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:51,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1718354823, now seen corresponding path program 44 times [2018-11-10 13:38:51,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:38:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:38:51,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:38:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 200590 backedges. 79908 proven. 3837 refuted. 0 times theorem prover too weak. 116845 trivial. 0 not checked. [2018-11-10 13:38:53,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:53,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:38:53,034 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:38:53,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:38:53,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:53,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:53,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:38:53,042 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:38:53,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-10 13:38:53,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:38:53,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 200590 backedges. 56149 proven. 3784 refuted. 0 times theorem prover too weak. 140657 trivial. 0 not checked. [2018-11-10 13:38:55,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 200590 backedges. 56149 proven. 3784 refuted. 0 times theorem prover too weak. 140657 trivial. 0 not checked. [2018-11-10 13:38:57,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:38:57,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49, 49] total 137 [2018-11-10 13:38:57,940 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:38:57,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-11-10 13:38:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-11-10 13:38:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2543, Invalid=16089, Unknown=0, NotChecked=0, Total=18632 [2018-11-10 13:38:57,942 INFO L87 Difference]: Start difference. First operand 2043 states and 2056 transitions. Second operand 94 states. [2018-11-10 13:39:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:01,059 INFO L93 Difference]: Finished difference Result 2205 states and 2216 transitions. [2018-11-10 13:39:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-10 13:39:01,059 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1775 [2018-11-10 13:39:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:01,063 INFO L225 Difference]: With dead ends: 2205 [2018-11-10 13:39:01,063 INFO L226 Difference]: Without dead ends: 2196 [2018-11-10 13:39:01,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3686 GetRequests, 3458 SyntacticMatches, 5 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16655 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=8363, Invalid=42037, Unknown=0, NotChecked=0, Total=50400 [2018-11-10 13:39:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2018-11-10 13:39:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2043. [2018-11-10 13:39:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2018-11-10 13:39:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2053 transitions. [2018-11-10 13:39:01,077 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2053 transitions. Word has length 1775 [2018-11-10 13:39:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:01,078 INFO L481 AbstractCegarLoop]: Abstraction has 2043 states and 2053 transitions. [2018-11-10 13:39:01,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-11-10 13:39:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2053 transitions. [2018-11-10 13:39:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1782 [2018-11-10 13:39:01,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:01,092 INFO L375 BasicCegarLoop]: trace histogram [272, 252, 252, 252, 251, 251, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:01,093 INFO L424 AbstractCegarLoop]: === Iteration 64 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:39:01,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash 64843842, now seen corresponding path program 45 times [2018-11-10 13:39:01,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:39:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:01,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:39:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:01,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:39:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 202135 backedges. 31132 proven. 1453 refuted. 0 times theorem prover too weak. 169550 trivial. 0 not checked. [2018-11-10 13:39:03,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:03,152 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:39:03,152 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:39:03,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:39:03,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:03,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:39:03,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:39:03,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:39:03,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:39:03,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:39:03,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:03,657 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 13:39:03,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:03,669 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 13:39:03,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 202135 backedges. 30784 proven. 5044 refuted. 0 times theorem prover too weak. 166307 trivial. 0 not checked. [2018-11-10 13:39:08,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 202135 backedges. 30789 proven. 5039 refuted. 0 times theorem prover too weak. 166307 trivial. 0 not checked. [2018-11-10 13:39:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:39:10,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33, 31] total 90 [2018-11-10 13:39:10,714 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:39:10,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-10 13:39:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-10 13:39:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=7191, Unknown=0, NotChecked=0, Total=8190 [2018-11-10 13:39:10,715 INFO L87 Difference]: Start difference. First operand 2043 states and 2053 transitions. Second operand 61 states. [2018-11-10 13:39:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:15,833 INFO L93 Difference]: Finished difference Result 2230 states and 2245 transitions. [2018-11-10 13:39:15,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-10 13:39:15,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1781 [2018-11-10 13:39:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:15,837 INFO L225 Difference]: With dead ends: 2230 [2018-11-10 13:39:15,838 INFO L226 Difference]: Without dead ends: 2230 [2018-11-10 13:39:15,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3645 GetRequests, 3480 SyntacticMatches, 20 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4949 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2923, Invalid=18539, Unknown=0, NotChecked=0, Total=21462 [2018-11-10 13:39:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2018-11-10 13:39:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2188. [2018-11-10 13:39:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2018-11-10 13:39:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 2200 transitions. [2018-11-10 13:39:15,857 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 2200 transitions. Word has length 1781 [2018-11-10 13:39:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:15,859 INFO L481 AbstractCegarLoop]: Abstraction has 2188 states and 2200 transitions. [2018-11-10 13:39:15,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-10 13:39:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2200 transitions. [2018-11-10 13:39:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1927 [2018-11-10 13:39:15,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:15,882 INFO L375 BasicCegarLoop]: trace histogram [295, 274, 274, 274, 273, 273, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:15,882 INFO L424 AbstractCegarLoop]: === Iteration 65 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:39:15,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1249726050, now seen corresponding path program 46 times [2018-11-10 13:39:15,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:39:15,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:15,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:39:15,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:15,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:39:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 238455 backedges. 66909 proven. 6450 refuted. 0 times theorem prover too weak. 165096 trivial. 0 not checked. [2018-11-10 13:39:17,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:17,817 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:39:17,817 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:39:17,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:39:17,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:17,817 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:39:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:17,822 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:39:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:18,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 238455 backedges. 67287 proven. 1302 refuted. 0 times theorem prover too weak. 169866 trivial. 0 not checked. [2018-11-10 13:39:19,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 238455 backedges. 67287 proven. 1302 refuted. 0 times theorem prover too weak. 169866 trivial. 0 not checked. [2018-11-10 13:39:21,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:39:21,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 46, 46] total 95 [2018-11-10 13:39:21,661 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:39:21,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-10 13:39:21,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-10 13:39:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=7035, Unknown=0, NotChecked=0, Total=8930 [2018-11-10 13:39:21,662 INFO L87 Difference]: Start difference. First operand 2188 states and 2200 transitions. Second operand 73 states. [2018-11-10 13:39:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:23,242 INFO L93 Difference]: Finished difference Result 2214 states and 2225 transitions. [2018-11-10 13:39:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-10 13:39:23,242 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1926 [2018-11-10 13:39:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:23,246 INFO L225 Difference]: With dead ends: 2214 [2018-11-10 13:39:23,247 INFO L226 Difference]: Without dead ends: 2208 [2018-11-10 13:39:23,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3948 GetRequests, 3786 SyntacticMatches, 23 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7139 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4629, Invalid=15111, Unknown=0, NotChecked=0, Total=19740 [2018-11-10 13:39:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2018-11-10 13:39:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2194. [2018-11-10 13:39:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2018-11-10 13:39:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2205 transitions. [2018-11-10 13:39:23,268 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2205 transitions. Word has length 1926 [2018-11-10 13:39:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:23,269 INFO L481 AbstractCegarLoop]: Abstraction has 2194 states and 2205 transitions. [2018-11-10 13:39:23,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-10 13:39:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2205 transitions. [2018-11-10 13:39:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1933 [2018-11-10 13:39:23,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:23,292 INFO L375 BasicCegarLoop]: trace histogram [296, 275, 275, 275, 274, 274, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:23,292 INFO L424 AbstractCegarLoop]: === Iteration 66 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:39:23,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:23,293 INFO L82 PathProgramCache]: Analyzing trace with hash -951000597, now seen corresponding path program 47 times [2018-11-10 13:39:23,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:39:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:23,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:39:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 240140 backedges. 36173 proven. 1599 refuted. 0 times theorem prover too weak. 202368 trivial. 0 not checked. [2018-11-10 13:39:25,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:25,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:39:25,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:39:25,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:39:25,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:25,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:39:25,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:39:25,881 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:39:26,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-10 13:39:26,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:39:26,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:26,401 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 13:39:26,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:26,404 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 13:39:26,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 240140 backedges. 35511 proven. 1496 refuted. 0 times theorem prover too weak. 203133 trivial. 0 not checked. [2018-11-10 13:39:31,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 240140 backedges. 35511 proven. 1496 refuted. 0 times theorem prover too weak. 203133 trivial. 0 not checked. [2018-11-10 13:39:33,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:39:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28, 27] total 87 [2018-11-10 13:39:33,935 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:39:33,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-10 13:39:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-10 13:39:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=6667, Unknown=0, NotChecked=0, Total=7656 [2018-11-10 13:39:33,936 INFO L87 Difference]: Start difference. First operand 2194 states and 2205 transitions. Second operand 62 states. [2018-11-10 13:39:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:37,838 INFO L93 Difference]: Finished difference Result 2406 states and 2424 transitions. [2018-11-10 13:39:37,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-10 13:39:37,838 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1932 [2018-11-10 13:39:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:37,842 INFO L225 Difference]: With dead ends: 2406 [2018-11-10 13:39:37,842 INFO L226 Difference]: Without dead ends: 2406 [2018-11-10 13:39:37,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3951 GetRequests, 3770 SyntacticMatches, 41 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4845 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2635, Invalid=17387, Unknown=0, NotChecked=0, Total=20022 [2018-11-10 13:39:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2018-11-10 13:39:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2345. [2018-11-10 13:39:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2345 states. [2018-11-10 13:39:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 2358 transitions. [2018-11-10 13:39:37,854 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 2358 transitions. Word has length 1932 [2018-11-10 13:39:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:37,855 INFO L481 AbstractCegarLoop]: Abstraction has 2345 states and 2358 transitions. [2018-11-10 13:39:37,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-10 13:39:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2358 transitions. [2018-11-10 13:39:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2084 [2018-11-10 13:39:37,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:37,871 INFO L375 BasicCegarLoop]: trace histogram [320, 298, 298, 298, 297, 297, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:37,871 INFO L424 AbstractCegarLoop]: === Iteration 67 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:39:37,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1860426736, now seen corresponding path program 48 times [2018-11-10 13:39:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:39:37,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:37,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:39:37,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:37,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:39:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 281424 backedges. 105393 proven. 4617 refuted. 0 times theorem prover too weak. 171414 trivial. 0 not checked. [2018-11-10 13:39:40,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:40,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:39:40,109 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:39:40,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:39:40,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:40,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:39:40,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:39:40,115 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:39:40,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:39:40,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:39:40,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 281424 backedges. 76425 proven. 5435 refuted. 0 times theorem prover too weak. 199564 trivial. 0 not checked. [2018-11-10 13:39:42,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 281424 backedges. 76433 proven. 5427 refuted. 0 times theorem prover too weak. 199564 trivial. 0 not checked. [2018-11-10 13:39:45,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:39:45,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 123 [2018-11-10 13:39:45,130 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:39:45,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-10 13:39:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-10 13:39:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2395, Invalid=12611, Unknown=0, NotChecked=0, Total=15006 [2018-11-10 13:39:45,131 INFO L87 Difference]: Start difference. First operand 2345 states and 2358 transitions. Second operand 98 states. [2018-11-10 13:39:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:47,804 INFO L93 Difference]: Finished difference Result 2384 states and 2397 transitions. [2018-11-10 13:39:47,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-10 13:39:47,805 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 2083 [2018-11-10 13:39:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:47,808 INFO L225 Difference]: With dead ends: 2384 [2018-11-10 13:39:47,808 INFO L226 Difference]: Without dead ends: 2378 [2018-11-10 13:39:47,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4285 GetRequests, 4071 SyntacticMatches, 26 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15759 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6442, Invalid=29468, Unknown=0, NotChecked=0, Total=35910 [2018-11-10 13:39:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2018-11-10 13:39:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2351. [2018-11-10 13:39:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2018-11-10 13:39:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 2363 transitions. [2018-11-10 13:39:47,820 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 2363 transitions. Word has length 2083 [2018-11-10 13:39:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:47,821 INFO L481 AbstractCegarLoop]: Abstraction has 2351 states and 2363 transitions. [2018-11-10 13:39:47,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-10 13:39:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2363 transitions. [2018-11-10 13:39:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2090 [2018-11-10 13:39:47,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:47,837 INFO L375 BasicCegarLoop]: trace histogram [321, 299, 299, 299, 298, 298, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:47,837 INFO L424 AbstractCegarLoop]: === Iteration 68 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:39:47,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash 892182393, now seen corresponding path program 49 times [2018-11-10 13:39:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:39:47,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:47,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:39:47,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:39:47,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:39:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 283255 backedges. 41199 proven. 1752 refuted. 0 times theorem prover too weak. 240304 trivial. 0 not checked. [2018-11-10 13:39:50,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:50,495 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:39:50,495 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:39:50,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:39:50,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:39:50,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:39:50,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:50,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:39:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:50,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:50,990 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 13:39:50,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:50,995 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 13:39:50,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 283255 backedges. 40403 proven. 1633 refuted. 0 times theorem prover too weak. 241219 trivial. 0 not checked. [2018-11-10 13:39:56,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 283255 backedges. 40403 proven. 1633 refuted. 0 times theorem prover too weak. 241219 trivial. 0 not checked. [2018-11-10 13:39:59,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:39:59,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29, 28] total 91 [2018-11-10 13:39:59,558 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:39:59,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-10 13:39:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-10 13:39:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1049, Invalid=7323, Unknown=0, NotChecked=0, Total=8372 [2018-11-10 13:39:59,560 INFO L87 Difference]: Start difference. First operand 2351 states and 2363 transitions. Second operand 65 states. [2018-11-10 13:40:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:04,149 INFO L93 Difference]: Finished difference Result 2597 states and 2619 transitions. [2018-11-10 13:40:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-10 13:40:04,149 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 2089 [2018-11-10 13:40:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:04,152 INFO L225 Difference]: With dead ends: 2597 [2018-11-10 13:40:04,152 INFO L226 Difference]: Without dead ends: 2597 [2018-11-10 13:40:04,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4269 GetRequests, 4080 SyntacticMatches, 43 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5372 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2773, Invalid=18983, Unknown=0, NotChecked=0, Total=21756 [2018-11-10 13:40:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2018-11-10 13:40:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2508. [2018-11-10 13:40:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2508 states. [2018-11-10 13:40:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 2522 transitions. [2018-11-10 13:40:04,171 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 2522 transitions. Word has length 2089 [2018-11-10 13:40:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:04,172 INFO L481 AbstractCegarLoop]: Abstraction has 2508 states and 2522 transitions. [2018-11-10 13:40:04,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-10 13:40:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 2522 transitions. [2018-11-10 13:40:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2247 [2018-11-10 13:40:04,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:04,196 INFO L375 BasicCegarLoop]: trace histogram [346, 323, 323, 323, 322, 322, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:04,196 INFO L424 AbstractCegarLoop]: === Iteration 69 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:40:04,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash 301050873, now seen corresponding path program 50 times [2018-11-10 13:40:04,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:40:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:04,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:40:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 329935 backedges. 86619 proven. 7674 refuted. 0 times theorem prover too weak. 235642 trivial. 0 not checked. [2018-11-10 13:40:06,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:06,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:40:06,584 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:40:06,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:40:06,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:06,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:40:06,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:40:06,613 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:40:07,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-10 13:40:07,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:40:07,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 329935 backedges. 83722 proven. 4972 refuted. 0 times theorem prover too weak. 241241 trivial. 0 not checked. [2018-11-10 13:40:10,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 329935 backedges. 83722 proven. 4972 refuted. 0 times theorem prover too weak. 241241 trivial. 0 not checked. [2018-11-10 13:40:13,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:40:13,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 55, 55] total 155 [2018-11-10 13:40:13,522 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:40:13,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-11-10 13:40:13,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-11-10 13:40:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=20627, Unknown=0, NotChecked=0, Total=23870 [2018-11-10 13:40:13,524 INFO L87 Difference]: Start difference. First operand 2508 states and 2522 transitions. Second operand 106 states. [2018-11-10 13:40:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:17,833 INFO L93 Difference]: Finished difference Result 2893 states and 2909 transitions. [2018-11-10 13:40:17,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-11-10 13:40:17,833 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 2246 [2018-11-10 13:40:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:17,836 INFO L225 Difference]: With dead ends: 2893 [2018-11-10 13:40:17,836 INFO L226 Difference]: Without dead ends: 2884 [2018-11-10 13:40:17,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4667 GetRequests, 4388 SyntacticMatches, 5 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26753 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10497, Invalid=65403, Unknown=0, NotChecked=0, Total=75900 [2018-11-10 13:40:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2018-11-10 13:40:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2855. [2018-11-10 13:40:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2018-11-10 13:40:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 2871 transitions. [2018-11-10 13:40:17,852 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 2871 transitions. Word has length 2246 [2018-11-10 13:40:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:17,853 INFO L481 AbstractCegarLoop]: Abstraction has 2855 states and 2871 transitions. [2018-11-10 13:40:17,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-11-10 13:40:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 2871 transitions. [2018-11-10 13:40:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2253 [2018-11-10 13:40:17,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:17,871 INFO L375 BasicCegarLoop]: trace histogram [347, 324, 324, 324, 323, 323, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:17,871 INFO L424 AbstractCegarLoop]: === Iteration 70 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:40:17,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1046394690, now seen corresponding path program 51 times [2018-11-10 13:40:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:40:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:17,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:40:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:17,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:40:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 331918 backedges. 45724 proven. 1776 refuted. 0 times theorem prover too weak. 284418 trivial. 0 not checked. [2018-11-10 13:40:20,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:20,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:40:20,802 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:40:20,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:40:20,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:20,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:40:20,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:40:20,810 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:40:21,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:40:21,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:40:21,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:21,462 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 13:40:21,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:21,470 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 13:40:21,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:40:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 331918 backedges. 45445 proven. 6490 refuted. 0 times theorem prover too weak. 279983 trivial. 0 not checked. [2018-11-10 13:40:28,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 331918 backedges. 45450 proven. 6485 refuted. 0 times theorem prover too weak. 279983 trivial. 0 not checked. [2018-11-10 13:40:31,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:40:31,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 36, 34] total 98 [2018-11-10 13:40:31,915 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:40:31,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-10 13:40:31,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-10 13:40:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=8660, Unknown=0, NotChecked=0, Total=9702 [2018-11-10 13:40:31,917 INFO L87 Difference]: Start difference. First operand 2855 states and 2871 transitions. Second operand 66 states. [2018-11-10 13:40:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:35,907 INFO L93 Difference]: Finished difference Result 2921 states and 2943 transitions. [2018-11-10 13:40:35,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 13:40:35,907 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 2252 [2018-11-10 13:40:35,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:35,910 INFO L225 Difference]: With dead ends: 2921 [2018-11-10 13:40:35,910 INFO L226 Difference]: Without dead ends: 2921 [2018-11-10 13:40:35,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4563 GetRequests, 4413 SyntacticMatches, 23 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2375, Invalid=14137, Unknown=0, NotChecked=0, Total=16512 [2018-11-10 13:40:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-11-10 13:40:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2861. [2018-11-10 13:40:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2861 states. [2018-11-10 13:40:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 2878 transitions. [2018-11-10 13:40:35,924 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 2878 transitions. Word has length 2252 [2018-11-10 13:40:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:35,925 INFO L481 AbstractCegarLoop]: Abstraction has 2861 states and 2878 transitions. [2018-11-10 13:40:35,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-10 13:40:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 2878 transitions. [2018-11-10 13:40:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2259 [2018-11-10 13:40:35,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:35,943 INFO L375 BasicCegarLoop]: trace histogram [348, 325, 325, 325, 324, 324, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:35,944 INFO L424 AbstractCegarLoop]: === Iteration 71 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:40:35,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 222350489, now seen corresponding path program 52 times [2018-11-10 13:40:35,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:40:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:35,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:40:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:35,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:40:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 333907 backedges. 49415 proven. 1914 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-11-10 13:40:38,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:38,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:40:38,268 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:40:38,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:40:38,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:38,269 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:40:38,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:38,277 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:40:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:38,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 333907 backedges. 49489 proven. 1840 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-11-10 13:40:40,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 333907 backedges. 49489 proven. 1840 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-11-10 13:40:42,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:40:42,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 81 [2018-11-10 13:40:42,868 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:40:42,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-10 13:40:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-10 13:40:42,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1486, Invalid=4994, Unknown=0, NotChecked=0, Total=6480 [2018-11-10 13:40:42,869 INFO L87 Difference]: Start difference. First operand 2861 states and 2878 transitions. Second operand 81 states. [2018-11-10 13:40:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:44,357 INFO L93 Difference]: Finished difference Result 3061 states and 3079 transitions. [2018-11-10 13:40:44,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-10 13:40:44,357 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 2258 [2018-11-10 13:40:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:44,360 INFO L225 Difference]: With dead ends: 3061 [2018-11-10 13:40:44,360 INFO L226 Difference]: Without dead ends: 3061 [2018-11-10 13:40:44,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4618 GetRequests, 4439 SyntacticMatches, 51 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5263 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4227, Invalid=12543, Unknown=0, NotChecked=0, Total=16770 [2018-11-10 13:40:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2018-11-10 13:40:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3036. [2018-11-10 13:40:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2018-11-10 13:40:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 3054 transitions. [2018-11-10 13:40:44,380 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 3054 transitions. Word has length 2258 [2018-11-10 13:40:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:44,381 INFO L481 AbstractCegarLoop]: Abstraction has 3036 states and 3054 transitions. [2018-11-10 13:40:44,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-10 13:40:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3054 transitions. [2018-11-10 13:40:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2416 [2018-11-10 13:40:44,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:44,403 INFO L375 BasicCegarLoop]: trace histogram [373, 349, 349, 349, 348, 348, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:44,403 INFO L424 AbstractCegarLoop]: === Iteration 72 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:40:44,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1597208487, now seen corresponding path program 53 times [2018-11-10 13:40:44,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:40:44,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:44,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:44,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:44,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:40:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 384444 backedges. 135786 proven. 5469 refuted. 0 times theorem prover too weak. 243189 trivial. 0 not checked. [2018-11-10 13:40:47,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:47,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:40:47,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:40:47,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:40:47,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:47,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:40:47,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:40:47,257 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:40:48,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-10 13:40:48,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:40:48,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 384444 backedges. 94599 proven. 5404 refuted. 0 times theorem prover too weak. 284441 trivial. 0 not checked. [2018-11-10 13:40:51,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 384444 backedges. 94599 proven. 5404 refuted. 0 times theorem prover too weak. 284441 trivial. 0 not checked. [2018-11-10 13:40:55,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:40:55,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 57, 57] total 161 [2018-11-10 13:40:55,231 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:40:55,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-11-10 13:40:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-11-10 13:40:55,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3523, Invalid=22237, Unknown=0, NotChecked=0, Total=25760 [2018-11-10 13:40:55,233 INFO L87 Difference]: Start difference. First operand 3036 states and 3054 transitions. Second operand 110 states. [2018-11-10 13:40:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:59,009 INFO L93 Difference]: Finished difference Result 3392 states and 3407 transitions. [2018-11-10 13:40:59,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-11-10 13:40:59,009 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 2415 [2018-11-10 13:40:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:59,013 INFO L225 Difference]: With dead ends: 3392 [2018-11-10 13:40:59,013 INFO L226 Difference]: Without dead ends: 3380 [2018-11-10 13:40:59,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4990 GetRequests, 4722 SyntacticMatches, 5 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23377 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11597, Invalid=58363, Unknown=0, NotChecked=0, Total=69960 [2018-11-10 13:40:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2018-11-10 13:40:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3033. [2018-11-10 13:40:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3033 states. [2018-11-10 13:40:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 3046 transitions. [2018-11-10 13:40:59,034 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 3046 transitions. Word has length 2415 [2018-11-10 13:40:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:59,035 INFO L481 AbstractCegarLoop]: Abstraction has 3033 states and 3046 transitions. [2018-11-10 13:40:59,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-11-10 13:40:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 3046 transitions. [2018-11-10 13:40:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2422 [2018-11-10 13:40:59,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:59,056 INFO L375 BasicCegarLoop]: trace histogram [374, 350, 350, 350, 349, 349, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:59,057 INFO L424 AbstractCegarLoop]: === Iteration 73 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:40:59,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash -445654288, now seen corresponding path program 54 times [2018-11-10 13:40:59,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:40:59,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:59,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:40:59,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:40:59,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:40:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:41:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 386585 backedges. 51492 proven. 1925 refuted. 0 times theorem prover too weak. 333168 trivial. 0 not checked. [2018-11-10 13:41:02,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:02,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:41:02,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:41:02,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:41:02,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:02,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:41:02,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:41:02,109 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:41:02,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:41:02,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:41:02,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:41:02,826 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 13:41:02,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:02,829 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 13:41:02,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:41:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 386585 backedges. 51202 proven. 7012 refuted. 0 times theorem prover too weak. 328371 trivial. 0 not checked. [2018-11-10 13:41:10,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:41:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 386585 backedges. 51207 proven. 7007 refuted. 0 times theorem prover too weak. 328371 trivial. 0 not checked. [2018-11-10 13:41:14,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:41:14,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 37, 35] total 101 [2018-11-10 13:41:14,039 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:41:14,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-10 13:41:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-10 13:41:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=9166, Unknown=0, NotChecked=0, Total=10302 [2018-11-10 13:41:14,041 INFO L87 Difference]: Start difference. First operand 3033 states and 3046 transitions. Second operand 68 states. [2018-11-10 13:41:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:41:17,918 INFO L93 Difference]: Finished difference Result 3061 states and 3076 transitions. [2018-11-10 13:41:17,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 13:41:17,918 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 2421 [2018-11-10 13:41:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:41:17,921 INFO L225 Difference]: With dead ends: 3061 [2018-11-10 13:41:17,921 INFO L226 Difference]: Without dead ends: 3061 [2018-11-10 13:41:17,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4903 GetRequests, 4748 SyntacticMatches, 24 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4734 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2611, Invalid=14945, Unknown=0, NotChecked=0, Total=17556 [2018-11-10 13:41:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2018-11-10 13:41:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3039. [2018-11-10 13:41:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3039 states. [2018-11-10 13:41:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 3053 transitions. [2018-11-10 13:41:17,936 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 3053 transitions. Word has length 2421 [2018-11-10 13:41:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:41:17,937 INFO L481 AbstractCegarLoop]: Abstraction has 3039 states and 3053 transitions. [2018-11-10 13:41:17,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-10 13:41:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 3053 transitions. [2018-11-10 13:41:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2428 [2018-11-10 13:41:17,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:41:17,958 INFO L375 BasicCegarLoop]: trace histogram [375, 351, 351, 351, 350, 350, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:41:17,958 INFO L424 AbstractCegarLoop]: === Iteration 74 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:41:17,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:41:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash -769133113, now seen corresponding path program 55 times [2018-11-10 13:41:17,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:41:17,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:41:17,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:41:17,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:41:17,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:41:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:41:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 388732 backedges. 55487 proven. 2081 refuted. 0 times theorem prover too weak. 331164 trivial. 0 not checked. [2018-11-10 13:41:20,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:20,631 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:41:20,631 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:41:20,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:41:20,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:20,631 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:41:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:41:20,642 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:41:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:41:21,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:41:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 388732 backedges. 55564 proven. 2004 refuted. 0 times theorem prover too weak. 331164 trivial. 0 not checked. [2018-11-10 13:41:23,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:41:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 388732 backedges. 55564 proven. 2004 refuted. 0 times theorem prover too weak. 331164 trivial. 0 not checked. [2018-11-10 13:41:25,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:41:25,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 84 [2018-11-10 13:41:25,828 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:41:25,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-10 13:41:25,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-10 13:41:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1597, Invalid=5375, Unknown=0, NotChecked=0, Total=6972 [2018-11-10 13:41:25,829 INFO L87 Difference]: Start difference. First operand 3039 states and 3053 transitions. Second operand 84 states. [2018-11-10 13:41:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:41:27,585 INFO L93 Difference]: Finished difference Result 3227 states and 3242 transitions. [2018-11-10 13:41:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-10 13:41:27,585 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 2427 [2018-11-10 13:41:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:41:27,589 INFO L225 Difference]: With dead ends: 3227 [2018-11-10 13:41:27,589 INFO L226 Difference]: Without dead ends: 3227 [2018-11-10 13:41:27,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4960 GetRequests, 4774 SyntacticMatches, 53 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5682 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4552, Invalid=13538, Unknown=0, NotChecked=0, Total=18090 [2018-11-10 13:41:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-11-10 13:41:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3208. [2018-11-10 13:41:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2018-11-10 13:41:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3223 transitions. [2018-11-10 13:41:27,605 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3223 transitions. Word has length 2427 [2018-11-10 13:41:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:41:27,605 INFO L481 AbstractCegarLoop]: Abstraction has 3208 states and 3223 transitions. [2018-11-10 13:41:27,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-10 13:41:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3223 transitions. [2018-11-10 13:41:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2591 [2018-11-10 13:41:27,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:41:27,632 INFO L375 BasicCegarLoop]: trace histogram [401, 376, 376, 376, 375, 375, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:41:27,632 INFO L424 AbstractCegarLoop]: === Iteration 75 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:41:27,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:41:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1298408784, now seen corresponding path program 56 times [2018-11-10 13:41:27,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:41:27,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:41:27,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:41:27,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:41:27,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:41:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:41:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 445425 backedges. 109849 proven. 9002 refuted. 0 times theorem prover too weak. 326574 trivial. 0 not checked. [2018-11-10 13:41:30,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:30,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:41:30,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:41:30,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:41:30,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:30,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:41:30,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:41:30,657 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:41:31,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-10 13:41:31,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:41:31,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:41:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 445425 backedges. 106379 proven. 5854 refuted. 0 times theorem prover too weak. 333192 trivial. 0 not checked. [2018-11-10 13:41:34,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:41:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 445425 backedges. 106379 proven. 5854 refuted. 0 times theorem prover too weak. 333192 trivial. 0 not checked. [2018-11-10 13:41:39,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:41:39,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 59, 59] total 167 [2018-11-10 13:41:39,198 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:41:39,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-11-10 13:41:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-11-10 13:41:39,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3771, Invalid=23951, Unknown=0, NotChecked=0, Total=27722 [2018-11-10 13:41:39,200 INFO L87 Difference]: Start difference. First operand 3208 states and 3223 transitions. Second operand 114 states. [2018-11-10 13:41:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:41:44,144 INFO L93 Difference]: Finished difference Result 3231 states and 3244 transitions. [2018-11-10 13:41:44,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-11-10 13:41:44,144 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 2590 [2018-11-10 13:41:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:41:44,149 INFO L225 Difference]: With dead ends: 3231 [2018-11-10 13:41:44,149 INFO L226 Difference]: Without dead ends: 3225 [2018-11-10 13:41:44,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5369 GetRequests, 5068 SyntacticMatches, 5 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31352 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=12197, Invalid=76309, Unknown=0, NotChecked=0, Total=88506 [2018-11-10 13:41:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2018-11-10 13:41:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3208. [2018-11-10 13:41:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2018-11-10 13:41:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3221 transitions. [2018-11-10 13:41:44,180 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3221 transitions. Word has length 2590 [2018-11-10 13:41:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:41:44,181 INFO L481 AbstractCegarLoop]: Abstraction has 3208 states and 3221 transitions. [2018-11-10 13:41:44,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-11-10 13:41:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3221 transitions. [2018-11-10 13:41:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2597 [2018-11-10 13:41:44,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:41:44,220 INFO L375 BasicCegarLoop]: trace histogram [402, 377, 377, 377, 376, 376, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:41:44,221 INFO L424 AbstractCegarLoop]: === Iteration 76 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:41:44,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:41:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1066883161, now seen corresponding path program 57 times [2018-11-10 13:41:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:41:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:41:44,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:41:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:41:44,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:41:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:41:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 447730 backedges. 57725 proven. 2080 refuted. 0 times theorem prover too weak. 387925 trivial. 0 not checked. [2018-11-10 13:41:47,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:47,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:41:47,822 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:41:47,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:41:47,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:47,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:41:47,829 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:41:47,829 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:41:48,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:41:48,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:41:48,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:41:48,709 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 13:41:48,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:48,716 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 13:41:48,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:41:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 447730 backedges. 57424 proven. 7554 refuted. 0 times theorem prover too weak. 382752 trivial. 0 not checked. [2018-11-10 13:41:57,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:42:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 447730 backedges. 57429 proven. 7549 refuted. 0 times theorem prover too weak. 382752 trivial. 0 not checked. [2018-11-10 13:42:01,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:42:01,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 38, 36] total 104 [2018-11-10 13:42:01,716 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:42:01,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-10 13:42:01,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-10 13:42:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1163, Invalid=9757, Unknown=0, NotChecked=0, Total=10920 [2018-11-10 13:42:01,718 INFO L87 Difference]: Start difference. First operand 3208 states and 3221 transitions. Second operand 70 states. [2018-11-10 13:42:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:42:05,806 INFO L93 Difference]: Finished difference Result 3236 states and 3251 transitions. [2018-11-10 13:42:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 13:42:05,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 2596 [2018-11-10 13:42:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:42:05,810 INFO L225 Difference]: With dead ends: 3236 [2018-11-10 13:42:05,810 INFO L226 Difference]: Without dead ends: 3236 [2018-11-10 13:42:05,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5254 GetRequests, 5095 SyntacticMatches, 25 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4948 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2618, Invalid=15742, Unknown=0, NotChecked=0, Total=18360 [2018-11-10 13:42:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-11-10 13:42:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3214. [2018-11-10 13:42:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2018-11-10 13:42:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 3228 transitions. [2018-11-10 13:42:05,828 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 3228 transitions. Word has length 2596 [2018-11-10 13:42:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:42:05,829 INFO L481 AbstractCegarLoop]: Abstraction has 3214 states and 3228 transitions. [2018-11-10 13:42:05,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-10 13:42:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 3228 transitions. [2018-11-10 13:42:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2603 [2018-11-10 13:42:05,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:42:05,856 INFO L375 BasicCegarLoop]: trace histogram [403, 378, 378, 378, 377, 377, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:42:05,856 INFO L424 AbstractCegarLoop]: === Iteration 77 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:42:05,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:42:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash -798228368, now seen corresponding path program 58 times [2018-11-10 13:42:05,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:42:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:42:05,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:42:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:42:05,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:42:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:42:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 450041 backedges. 62036 proven. 2255 refuted. 0 times theorem prover too weak. 385750 trivial. 0 not checked. [2018-11-10 13:42:08,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:42:08,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:42:08,889 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:42:08,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:42:08,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:42:08,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:42:08,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:42:08,898 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:42:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:42:09,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:42:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 450041 backedges. 62116 proven. 2175 refuted. 0 times theorem prover too weak. 385750 trivial. 0 not checked. [2018-11-10 13:42:12,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:42:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 450041 backedges. 62116 proven. 2175 refuted. 0 times theorem prover too weak. 385750 trivial. 0 not checked. [2018-11-10 13:42:14,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:42:14,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 87 [2018-11-10 13:42:14,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:42:14,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-10 13:42:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-10 13:42:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1712, Invalid=5770, Unknown=0, NotChecked=0, Total=7482 [2018-11-10 13:42:14,782 INFO L87 Difference]: Start difference. First operand 3214 states and 3228 transitions. Second operand 87 states. [2018-11-10 13:42:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:42:16,887 INFO L93 Difference]: Finished difference Result 3408 states and 3423 transitions. [2018-11-10 13:42:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-10 13:42:16,887 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 2602 [2018-11-10 13:42:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:42:16,892 INFO L225 Difference]: With dead ends: 3408 [2018-11-10 13:42:16,893 INFO L226 Difference]: Without dead ends: 3408 [2018-11-10 13:42:16,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5314 GetRequests, 5121 SyntacticMatches, 55 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6117 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4889, Invalid=14571, Unknown=0, NotChecked=0, Total=19460 [2018-11-10 13:42:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2018-11-10 13:42:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3389. [2018-11-10 13:42:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3389 states. [2018-11-10 13:42:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 3404 transitions. [2018-11-10 13:42:16,919 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 3404 transitions. Word has length 2602 [2018-11-10 13:42:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:42:16,920 INFO L481 AbstractCegarLoop]: Abstraction has 3389 states and 3404 transitions. [2018-11-10 13:42:16,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-10 13:42:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 3404 transitions. [2018-11-10 13:42:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2772 [2018-11-10 13:42:16,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:42:16,961 INFO L375 BasicCegarLoop]: trace histogram [430, 404, 404, 404, 403, 403, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:42:16,962 INFO L424 AbstractCegarLoop]: === Iteration 78 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:42:16,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:42:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1828966302, now seen corresponding path program 59 times [2018-11-10 13:42:16,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:42:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:42:16,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:42:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:42:16,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:42:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:42:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 513370 backedges. 171519 proven. 6393 refuted. 0 times theorem prover too weak. 335458 trivial. 0 not checked. [2018-11-10 13:42:20,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:42:20,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:42:20,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:42:20,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:42:20,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:42:20,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:42:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:42:20,561 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:42:22,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-10 13:42:22,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:42:22,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:42:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 513370 backedges. 119098 proven. 6322 refuted. 0 times theorem prover too weak. 387950 trivial. 0 not checked. [2018-11-10 13:42:26,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:42:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 513370 backedges. 119098 proven. 6322 refuted. 0 times theorem prover too weak. 387950 trivial. 0 not checked. [2018-11-10 13:42:31,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:42:31,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 61, 61] total 173 [2018-11-10 13:42:31,056 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:42:31,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-11-10 13:42:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-11-10 13:42:31,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4073, Invalid=25683, Unknown=0, NotChecked=0, Total=29756 [2018-11-10 13:42:31,058 INFO L87 Difference]: Start difference. First operand 3389 states and 3404 transitions. Second operand 118 states. [2018-11-10 13:42:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:42:35,795 INFO L93 Difference]: Finished difference Result 3412 states and 3425 transitions. [2018-11-10 13:42:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-11-10 13:42:35,796 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 2771 [2018-11-10 13:42:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:42:35,799 INFO L225 Difference]: With dead ends: 3412 [2018-11-10 13:42:35,799 INFO L226 Difference]: Without dead ends: 3406 [2018-11-10 13:42:35,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5714 GetRequests, 5426 SyntacticMatches, 5 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27164 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=13412, Invalid=67528, Unknown=0, NotChecked=0, Total=80940 [2018-11-10 13:42:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2018-11-10 13:42:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3389. [2018-11-10 13:42:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3389 states. [2018-11-10 13:42:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 3402 transitions. [2018-11-10 13:42:35,816 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 3402 transitions. Word has length 2771 [2018-11-10 13:42:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:42:35,817 INFO L481 AbstractCegarLoop]: Abstraction has 3389 states and 3402 transitions. [2018-11-10 13:42:35,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-11-10 13:42:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 3402 transitions. [2018-11-10 13:42:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2778 [2018-11-10 13:42:35,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:42:35,844 INFO L375 BasicCegarLoop]: trace histogram [431, 405, 405, 405, 404, 404, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:42:35,845 INFO L424 AbstractCegarLoop]: === Iteration 79 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:42:35,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:42:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash -979033433, now seen corresponding path program 60 times [2018-11-10 13:42:35,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:42:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:42:35,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:42:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:42:35,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:42:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:42:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 515845 backedges. 119361 proven. 6806 refuted. 0 times theorem prover too weak. 389678 trivial. 0 not checked. [2018-11-10 13:42:42,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:42:42,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:42:42,730 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:42:42,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 13:42:42,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:42:42,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:42:42,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:42:42,738 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:42:43,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:42:43,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:42:43,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:42:43,594 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 13:42:43,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:42:43,601 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 13:42:43,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:42:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 515845 backedges. 64129 proven. 8116 refuted. 0 times theorem prover too weak. 443600 trivial. 0 not checked. [2018-11-10 13:42:53,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:42:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 515845 backedges. 64134 proven. 8111 refuted. 0 times theorem prover too weak. 443600 trivial. 0 not checked. [2018-11-10 13:42:57,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:42:57,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 37] total 115 [2018-11-10 13:42:57,883 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:42:57,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-10 13:42:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-10 13:42:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=12111, Unknown=0, NotChecked=0, Total=13340 [2018-11-10 13:42:57,884 INFO L87 Difference]: Start difference. First operand 3389 states and 3402 transitions. Second operand 80 states. [2018-11-10 13:43:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:43:06,457 INFO L93 Difference]: Finished difference Result 3615 states and 3633 transitions. [2018-11-10 13:43:06,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-11-10 13:43:06,457 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 2777 [2018-11-10 13:43:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:43:06,462 INFO L225 Difference]: With dead ends: 3615 [2018-11-10 13:43:06,462 INFO L226 Difference]: Without dead ends: 3615 [2018-11-10 13:43:06,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5693 GetRequests, 5454 SyntacticMatches, 26 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11755 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=6271, Invalid=39739, Unknown=0, NotChecked=0, Total=46010 [2018-11-10 13:43:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-11-10 13:43:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3582. [2018-11-10 13:43:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3582 states. [2018-11-10 13:43:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 3598 transitions. [2018-11-10 13:43:06,483 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 3598 transitions. Word has length 2777 [2018-11-10 13:43:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:43:06,484 INFO L481 AbstractCegarLoop]: Abstraction has 3582 states and 3598 transitions. [2018-11-10 13:43:06,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-10 13:43:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 3598 transitions. [2018-11-10 13:43:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2965 [2018-11-10 13:43:06,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:43:06,521 INFO L375 BasicCegarLoop]: trace histogram [461, 434, 434, 434, 433, 433, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:43:06,521 INFO L424 AbstractCegarLoop]: === Iteration 80 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:43:06,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:43:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1563220688, now seen corresponding path program 61 times [2018-11-10 13:43:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:43:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:43:06,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:43:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:43:06,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:43:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:43:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 591440 backedges. 72254 proven. 2622 refuted. 0 times theorem prover too weak. 516564 trivial. 0 not checked. [2018-11-10 13:43:14,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:43:14,464 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:43:14,465 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:43:14,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:43:14,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:43:14,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:43:14,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:43:14,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:43:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:43:15,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:43:15,197 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 13:43:15,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:43:15,201 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 13:43:15,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:43:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 591440 backedges. 71658 proven. 2408 refuted. 0 times theorem prover too weak. 517374 trivial. 0 not checked. [2018-11-10 13:43:26,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:43:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 591440 backedges. 71658 proven. 2408 refuted. 0 times theorem prover too weak. 517374 trivial. 0 not checked. [2018-11-10 13:43:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:43:30,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 33] total 103 [2018-11-10 13:43:30,494 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:43:30,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-10 13:43:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-10 13:43:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=9463, Unknown=0, NotChecked=0, Total=10712 [2018-11-10 13:43:30,495 INFO L87 Difference]: Start difference. First operand 3582 states and 3598 transitions. Second operand 72 states. [2018-11-10 13:43:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:43:37,301 INFO L93 Difference]: Finished difference Result 4050 states and 4082 transitions. [2018-11-10 13:43:37,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-10 13:43:37,301 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 2964 [2018-11-10 13:43:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:43:37,305 INFO L225 Difference]: With dead ends: 4050 [2018-11-10 13:43:37,305 INFO L226 Difference]: Without dead ends: 4050 [2018-11-10 13:43:37,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6031 GetRequests, 5810 SyntacticMatches, 53 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6682 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3145, Invalid=25585, Unknown=0, NotChecked=0, Total=28730 [2018-11-10 13:43:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2018-11-10 13:43:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3779. [2018-11-10 13:43:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3779 states. [2018-11-10 13:43:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 3800 transitions. [2018-11-10 13:43:37,325 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 3800 transitions. Word has length 2964 [2018-11-10 13:43:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:43:37,327 INFO L481 AbstractCegarLoop]: Abstraction has 3779 states and 3800 transitions. [2018-11-10 13:43:37,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-10 13:43:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 3800 transitions. [2018-11-10 13:43:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3146 [2018-11-10 13:43:37,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:43:37,362 INFO L375 BasicCegarLoop]: trace histogram [490, 462, 462, 462, 461, 461, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:43:37,362 INFO L424 AbstractCegarLoop]: === Iteration 81 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:43:37,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:43:37,363 INFO L82 PathProgramCache]: Analyzing trace with hash 228962366, now seen corresponding path program 62 times [2018-11-10 13:43:37,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:43:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:43:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:43:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:43:37,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:43:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:43:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 669383 backedges. 144623 proven. 15656 refuted. 0 times theorem prover too weak. 509104 trivial. 0 not checked. [2018-11-10 13:43:41,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:43:41,561 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:43:41,561 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:43:41,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:43:41,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:43:41,561 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:43:41,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:43:41,569 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:43:43,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-10 13:43:43,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:43:43,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:43:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 669383 backedges. 140537 proven. 11630 refuted. 0 times theorem prover too weak. 517216 trivial. 0 not checked. [2018-11-10 13:43:48,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:43:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 669383 backedges. 140537 proven. 11630 refuted. 0 times theorem prover too weak. 517216 trivial. 0 not checked. [2018-11-10 13:43:53,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:43:53,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 65, 65] total 182 [2018-11-10 13:43:53,764 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:43:53,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-11-10 13:43:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-11-10 13:43:53,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4435, Invalid=28507, Unknown=0, NotChecked=0, Total=32942 [2018-11-10 13:43:53,766 INFO L87 Difference]: Start difference. First operand 3779 states and 3800 transitions. Second operand 124 states. [2018-11-10 13:43:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:43:59,549 INFO L93 Difference]: Finished difference Result 3806 states and 3822 transitions. [2018-11-10 13:43:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-11-10 13:43:59,549 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 3145 [2018-11-10 13:43:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:43:59,555 INFO L225 Difference]: With dead ends: 3806 [2018-11-10 13:43:59,555 INFO L226 Difference]: Without dead ends: 3797 [2018-11-10 13:43:59,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6495 GetRequests, 6166 SyntacticMatches, 6 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37612 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=14301, Invalid=90999, Unknown=0, NotChecked=0, Total=105300 [2018-11-10 13:43:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2018-11-10 13:43:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3775. [2018-11-10 13:43:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3775 states. [2018-11-10 13:43:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 3791 transitions. [2018-11-10 13:43:59,584 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 3791 transitions. Word has length 3145 [2018-11-10 13:43:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:43:59,585 INFO L481 AbstractCegarLoop]: Abstraction has 3775 states and 3791 transitions. [2018-11-10 13:43:59,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-11-10 13:43:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 3791 transitions. [2018-11-10 13:43:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3152 [2018-11-10 13:43:59,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:43:59,623 INFO L375 BasicCegarLoop]: trace histogram [491, 463, 463, 463, 462, 462, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:43:59,624 INFO L424 AbstractCegarLoop]: === Iteration 82 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:43:59,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:43:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1633442859, now seen corresponding path program 63 times [2018-11-10 13:43:59,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:43:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:43:59,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:43:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:43:59,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:43:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:44:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 672210 backedges. 213024 proven. 7389 refuted. 0 times theorem prover too weak. 451797 trivial. 0 not checked. [2018-11-10 13:44:04,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:44:04,243 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:44:04,243 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:44:04,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:44:04,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:44:04,243 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:44:04,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:44:04,254 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:44:04,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:44:04,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:44:04,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:44:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 672210 backedges. 152043 proven. 8609 refuted. 0 times theorem prover too weak. 511558 trivial. 0 not checked. [2018-11-10 13:44:08,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:44:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 672210 backedges. 152051 proven. 8601 refuted. 0 times theorem prover too weak. 511558 trivial. 0 not checked. [2018-11-10 13:44:13,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:44:13,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 153 [2018-11-10 13:44:13,745 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:44:13,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-11-10 13:44:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-11-10 13:44:13,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3709, Invalid=19547, Unknown=0, NotChecked=0, Total=23256 [2018-11-10 13:44:13,747 INFO L87 Difference]: Start difference. First operand 3775 states and 3791 transitions. Second operand 122 states. [2018-11-10 13:44:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:44:17,424 INFO L93 Difference]: Finished difference Result 3797 states and 3811 transitions. [2018-11-10 13:44:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-11-10 13:44:17,424 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 3151 [2018-11-10 13:44:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:44:17,430 INFO L225 Difference]: With dead ends: 3797 [2018-11-10 13:44:17,430 INFO L226 Difference]: Without dead ends: 3791 [2018-11-10 13:44:17,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6451 GetRequests, 6183 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25269 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9949, Invalid=46457, Unknown=0, NotChecked=0, Total=56406 [2018-11-10 13:44:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2018-11-10 13:44:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3775. [2018-11-10 13:44:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3775 states. [2018-11-10 13:44:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 3789 transitions. [2018-11-10 13:44:17,454 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 3789 transitions. Word has length 3151 [2018-11-10 13:44:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:44:17,456 INFO L481 AbstractCegarLoop]: Abstraction has 3775 states and 3789 transitions. [2018-11-10 13:44:17,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-11-10 13:44:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 3789 transitions. [2018-11-10 13:44:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3158 [2018-11-10 13:44:17,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:44:17,493 INFO L375 BasicCegarLoop]: trace histogram [492, 464, 464, 464, 463, 463, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:44:17,494 INFO L424 AbstractCegarLoop]: === Iteration 83 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:44:17,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:44:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1991493986, now seen corresponding path program 64 times [2018-11-10 13:44:17,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:44:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:44:17,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:44:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:44:17,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:44:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:44:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 675043 backedges. 79536 proven. 2817 refuted. 0 times theorem prover too weak. 592690 trivial. 0 not checked. [2018-11-10 13:44:23,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:44:23,363 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:44:23,363 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:44:23,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:44:23,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:44:23,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:44:23,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:44:23,369 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:44:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:44:24,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:44:24,120 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 13:44:24,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:44:24,133 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 13:44:24,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:44:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 675043 backedges. 79394 proven. 2581 refuted. 0 times theorem prover too weak. 593068 trivial. 0 not checked. [2018-11-10 13:44:36,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:44:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 675043 backedges. 79394 proven. 2581 refuted. 0 times theorem prover too weak. 593068 trivial. 0 not checked. [2018-11-10 13:44:41,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:44:41,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 34] total 103 [2018-11-10 13:44:41,635 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:44:41,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-10 13:44:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-10 13:44:41,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1271, Invalid=9441, Unknown=0, NotChecked=0, Total=10712 [2018-11-10 13:44:41,636 INFO L87 Difference]: Start difference. First operand 3775 states and 3789 transitions. Second operand 71 states. [2018-11-10 13:44:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:44:47,971 INFO L93 Difference]: Finished difference Result 4016 states and 4035 transitions. [2018-11-10 13:44:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-10 13:44:47,971 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 3157 [2018-11-10 13:44:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:44:47,974 INFO L225 Difference]: With dead ends: 4016 [2018-11-10 13:44:47,975 INFO L226 Difference]: Without dead ends: 4016 [2018-11-10 13:44:47,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6417 GetRequests, 6192 SyntacticMatches, 55 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6437 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3118, Invalid=26294, Unknown=0, NotChecked=0, Total=29412 [2018-11-10 13:44:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-11-10 13:44:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3968. [2018-11-10 13:44:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3968 states. [2018-11-10 13:44:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 3984 transitions. [2018-11-10 13:44:47,991 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 3984 transitions. Word has length 3157 [2018-11-10 13:44:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:44:47,992 INFO L481 AbstractCegarLoop]: Abstraction has 3968 states and 3984 transitions. [2018-11-10 13:44:47,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-10 13:44:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 3984 transitions. [2018-11-10 13:44:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3351 [2018-11-10 13:44:48,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:44:48,030 INFO L375 BasicCegarLoop]: trace histogram [523, 494, 494, 494, 493, 493, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:44:48,030 INFO L424 AbstractCegarLoop]: === Iteration 84 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:44:48,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:44:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1356802878, now seen corresponding path program 65 times [2018-11-10 13:44:48,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:44:48,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:44:48,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:44:48,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:44:48,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:44:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:44:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 764179 backedges. 168021 proven. 11970 refuted. 0 times theorem prover too weak. 584188 trivial. 0 not checked. [2018-11-10 13:44:52,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:44:52,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:44:52,671 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:44:52,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:44:52,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:44:52,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:44:52,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:44:52,678 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:44:55,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-11-10 13:44:55,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:44:55,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:45:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 764179 backedges. 163249 proven. 7834 refuted. 0 times theorem prover too weak. 593096 trivial. 0 not checked. [2018-11-10 13:45:00,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:45:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 764179 backedges. 163249 proven. 7834 refuted. 0 times theorem prover too weak. 593096 trivial. 0 not checked. [2018-11-10 13:45:06,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:45:06,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 67, 67] total 191 [2018-11-10 13:45:06,605 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:45:06,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-11-10 13:45:06,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-11-10 13:45:06,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4947, Invalid=31343, Unknown=0, NotChecked=0, Total=36290 [2018-11-10 13:45:06,607 INFO L87 Difference]: Start difference. First operand 3968 states and 3984 transitions. Second operand 130 states. [2018-11-10 13:45:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:45:12,833 INFO L93 Difference]: Finished difference Result 4000 states and 4014 transitions. [2018-11-10 13:45:12,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-11-10 13:45:12,833 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 3350 [2018-11-10 13:45:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:45:12,838 INFO L225 Difference]: With dead ends: 4000 [2018-11-10 13:45:12,838 INFO L226 Difference]: Without dead ends: 3994 [2018-11-10 13:45:12,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6917 GetRequests, 6572 SyntacticMatches, 5 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41642 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=15981, Invalid=100641, Unknown=0, NotChecked=0, Total=116622 [2018-11-10 13:45:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2018-11-10 13:45:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3974. [2018-11-10 13:45:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2018-11-10 13:45:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 3988 transitions. [2018-11-10 13:45:12,868 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 3988 transitions. Word has length 3350 [2018-11-10 13:45:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:45:12,869 INFO L481 AbstractCegarLoop]: Abstraction has 3974 states and 3988 transitions. [2018-11-10 13:45:12,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-11-10 13:45:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 3988 transitions. [2018-11-10 13:45:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3357 [2018-11-10 13:45:12,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:45:12,909 INFO L375 BasicCegarLoop]: trace histogram [524, 495, 495, 495, 494, 494, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:45:12,909 INFO L424 AbstractCegarLoop]: === Iteration 85 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:45:12,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:45:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1247067591, now seen corresponding path program 66 times [2018-11-10 13:45:12,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:45:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:45:12,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:45:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:45:12,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:45:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:45:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 767200 backedges. 87667 proven. 2760 refuted. 0 times theorem prover too weak. 676773 trivial. 0 not checked. [2018-11-10 13:45:18,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:45:18,505 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:45:18,506 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:45:18,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:45:18,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:45:18,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:45:18,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:45:18,513 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:45:19,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:45:19,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:45:19,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:45:19,677 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 13:45:19,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:45:19,683 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 13:45:19,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:45:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 767200 backedges. 87322 proven. 9922 refuted. 0 times theorem prover too weak. 669956 trivial. 0 not checked. [2018-11-10 13:45:33,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:45:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 767200 backedges. 87327 proven. 9917 refuted. 0 times theorem prover too weak. 669956 trivial. 0 not checked. [2018-11-10 13:45:39,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:45:39,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 42, 40] total 115 [2018-11-10 13:45:39,433 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:45:39,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-10 13:45:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-10 13:45:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1427, Invalid=11913, Unknown=0, NotChecked=0, Total=13340 [2018-11-10 13:45:39,434 INFO L87 Difference]: Start difference. First operand 3974 states and 3988 transitions. Second operand 77 states. [2018-11-10 13:45:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:45:45,511 INFO L93 Difference]: Finished difference Result 4005 states and 4021 transitions. [2018-11-10 13:45:45,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 13:45:45,511 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 3356 [2018-11-10 13:45:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:45:45,517 INFO L225 Difference]: With dead ends: 4005 [2018-11-10 13:45:45,517 INFO L226 Difference]: Without dead ends: 4005 [2018-11-10 13:45:45,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6783 GetRequests, 6603 SyntacticMatches, 30 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2510, Invalid=20442, Unknown=0, NotChecked=0, Total=22952 [2018-11-10 13:45:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2018-11-10 13:45:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3980. [2018-11-10 13:45:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3980 states. [2018-11-10 13:45:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 3995 transitions. [2018-11-10 13:45:45,537 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 3995 transitions. Word has length 3356 [2018-11-10 13:45:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:45:45,539 INFO L481 AbstractCegarLoop]: Abstraction has 3980 states and 3995 transitions. [2018-11-10 13:45:45,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-10 13:45:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 3995 transitions. [2018-11-10 13:45:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3363 [2018-11-10 13:45:45,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:45:45,578 INFO L375 BasicCegarLoop]: trace histogram [525, 496, 496, 496, 495, 495, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:45:45,578 INFO L424 AbstractCegarLoop]: === Iteration 86 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:45:45,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:45:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1447617698, now seen corresponding path program 67 times [2018-11-10 13:45:45,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:45:45,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:45:45,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:45:45,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:45:45,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:45:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:45:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 770227 backedges. 93362 proven. 3021 refuted. 0 times theorem prover too weak. 673844 trivial. 0 not checked. [2018-11-10 13:45:50,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:45:50,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:45:50,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:45:50,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:45:50,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:45:50,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:45:50,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:45:50,156 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:45:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:45:50,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:45:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 770227 backedges. 93454 proven. 2929 refuted. 0 times theorem prover too weak. 673844 trivial. 0 not checked. [2018-11-10 13:45:55,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:45:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 770227 backedges. 93454 proven. 2929 refuted. 0 times theorem prover too weak. 673844 trivial. 0 not checked. [2018-11-10 13:45:58,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:45:58,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 99 [2018-11-10 13:45:58,804 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:45:58,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-10 13:45:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-10 13:45:58,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=7490, Unknown=0, NotChecked=0, Total=9702 [2018-11-10 13:45:58,806 INFO L87 Difference]: Start difference. First operand 3980 states and 3995 transitions. Second operand 99 states. [2018-11-10 13:46:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:46:00,777 INFO L93 Difference]: Finished difference Result 4201 states and 4217 transitions. [2018-11-10 13:46:00,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-10 13:46:00,777 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 3362 [2018-11-10 13:46:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:46:00,781 INFO L225 Difference]: With dead ends: 4201 [2018-11-10 13:46:00,782 INFO L226 Difference]: Without dead ends: 4201 [2018-11-10 13:46:00,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6850 GetRequests, 6629 SyntacticMatches, 63 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8017 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6357, Invalid=19083, Unknown=0, NotChecked=0, Total=25440 [2018-11-10 13:46:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4201 states. [2018-11-10 13:46:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4201 to 4179. [2018-11-10 13:46:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-11-10 13:46:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 4195 transitions. [2018-11-10 13:46:00,804 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 4195 transitions. Word has length 3362 [2018-11-10 13:46:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:46:00,835 INFO L481 AbstractCegarLoop]: Abstraction has 4179 states and 4195 transitions. [2018-11-10 13:46:00,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-11-10 13:46:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 4195 transitions. [2018-11-10 13:46:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3556 [2018-11-10 13:46:00,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:46:00,876 INFO L375 BasicCegarLoop]: trace histogram [556, 526, 526, 526, 525, 525, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:46:00,876 INFO L424 AbstractCegarLoop]: === Iteration 87 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:46:00,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:46:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash -53513140, now seen corresponding path program 68 times [2018-11-10 13:46:00,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:46:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:46:00,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:46:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:46:00,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:46:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:46:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 865260 backedges. 260733 proven. 8457 refuted. 0 times theorem prover too weak. 596070 trivial. 0 not checked. [2018-11-10 13:46:06,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:46:06,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:46:06,290 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:46:06,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:46:06,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:46:06,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:46:06,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:46:06,333 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:46:10,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-10 13:46:10,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:46:10,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:46:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 865260 backedges. 180084 proven. 8374 refuted. 0 times theorem prover too weak. 676802 trivial. 0 not checked. [2018-11-10 13:46:16,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:46:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 865260 backedges. 180084 proven. 8374 refuted. 0 times theorem prover too weak. 676802 trivial. 0 not checked. [2018-11-10 13:46:22,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:46:22,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 69, 69] total 197 [2018-11-10 13:46:22,793 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:46:22,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-11-10 13:46:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-11-10 13:46:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5293, Invalid=33319, Unknown=0, NotChecked=0, Total=38612 [2018-11-10 13:46:22,795 INFO L87 Difference]: Start difference. First operand 4179 states and 4195 transitions. Second operand 134 states. [2018-11-10 13:46:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:46:28,196 INFO L93 Difference]: Finished difference Result 4205 states and 4219 transitions. [2018-11-10 13:46:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-11-10 13:46:28,197 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 3555 [2018-11-10 13:46:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:46:28,201 INFO L225 Difference]: With dead ends: 4205 [2018-11-10 13:46:28,201 INFO L226 Difference]: Without dead ends: 4199 [2018-11-10 13:46:28,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7306 GetRequests, 6978 SyntacticMatches, 5 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35590 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=17438, Invalid=87862, Unknown=0, NotChecked=0, Total=105300 [2018-11-10 13:46:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2018-11-10 13:46:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4179. [2018-11-10 13:46:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-11-10 13:46:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 4193 transitions. [2018-11-10 13:46:28,223 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 4193 transitions. Word has length 3555 [2018-11-10 13:46:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:46:28,224 INFO L481 AbstractCegarLoop]: Abstraction has 4179 states and 4193 transitions. [2018-11-10 13:46:28,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-11-10 13:46:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 4193 transitions. [2018-11-10 13:46:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3562 [2018-11-10 13:46:28,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:46:28,266 INFO L375 BasicCegarLoop]: trace histogram [557, 527, 527, 527, 526, 526, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:46:28,266 INFO L424 AbstractCegarLoop]: === Iteration 88 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:46:28,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:46:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1828820693, now seen corresponding path program 69 times [2018-11-10 13:46:28,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:46:28,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:46:28,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:46:28,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:46:28,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:46:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:46:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 868475 backedges. 182743 proven. 8930 refuted. 0 times theorem prover too weak. 676802 trivial. 0 not checked. [2018-11-10 13:46:39,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:46:39,567 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:46:39,567 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:46:39,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:46:39,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:46:39,568 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 13:46:39,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:46:39,576 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:46:40,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:46:40,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:46:40,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:46:40,909 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 13:46:40,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:46:40,926 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 13:46:40,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 13:46:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 868475 backedges. 96139 proven. 10564 refuted. 0 times theorem prover too weak. 761772 trivial. 0 not checked. [2018-11-10 13:46:56,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:47:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 868475 backedges. 96144 proven. 10559 refuted. 0 times theorem prover too weak. 761772 trivial. 0 not checked. [2018-11-10 13:47:03,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:47:03,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 43, 41] total 155 [2018-11-10 13:47:03,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:47:03,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-11-10 13:47:03,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-11-10 13:47:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1995, Invalid=22185, Unknown=0, NotChecked=0, Total=24180 [2018-11-10 13:47:03,253 INFO L87 Difference]: Start difference. First operand 4179 states and 4193 transitions. Second operand 116 states. [2018-11-10 13:47:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:47:12,329 INFO L93 Difference]: Finished difference Result 4423 states and 4441 transitions. [2018-11-10 13:47:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-11-10 13:47:12,329 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 3561 [2018-11-10 13:47:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:47:12,333 INFO L225 Difference]: With dead ends: 4423 [2018-11-10 13:47:12,334 INFO L226 Difference]: Without dead ends: 4423 [2018-11-10 13:47:12,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7302 GetRequests, 7010 SyntacticMatches, 30 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21249 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=8210, Invalid=61222, Unknown=0, NotChecked=0, Total=69432 [2018-11-10 13:47:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4423 states. [2018-11-10 13:47:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4423 to 4396. [2018-11-10 13:47:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4396 states. [2018-11-10 13:47:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4396 states to 4396 states and 4413 transitions. [2018-11-10 13:47:12,353 INFO L78 Accepts]: Start accepts. Automaton has 4396 states and 4413 transitions. Word has length 3561 [2018-11-10 13:47:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:47:12,354 INFO L481 AbstractCegarLoop]: Abstraction has 4396 states and 4413 transitions. [2018-11-10 13:47:12,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-11-10 13:47:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4396 states and 4413 transitions. [2018-11-10 13:47:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3773 [2018-11-10 13:47:12,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:47:12,401 INFO L375 BasicCegarLoop]: trace histogram [591, 560, 560, 560, 559, 559, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:47:12,401 INFO L424 AbstractCegarLoop]: === Iteration 89 === [fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 13:47:12,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:47:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash -985071074, now seen corresponding path program 70 times [2018-11-10 13:47:12,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:47:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:47:12,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:47:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:47:12,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:47:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:47:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:47:31,429 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:47:31,468 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,469 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,469 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,469 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,469 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,469 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,471 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,471 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,472 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,472 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,472 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,472 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,473 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,488 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,489 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,489 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,489 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,489 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,489 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,490 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,491 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,491 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,492 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,492 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,492 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,492 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,492 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,492 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,493 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,493 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,493 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,493 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,493 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,493 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,495 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,495 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,495 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,495 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,495 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,496 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,496 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,496 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,496 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,496 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,496 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,497 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,497 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,497 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,498 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,500 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,500 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,500 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,500 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,500 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,500 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,502 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,502 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,502 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,502 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,510 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,517 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,521 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,521 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,525 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,538 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,543 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,543 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,543 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,543 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,544 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,544 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,544 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,544 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,544 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,544 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,544 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,545 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,545 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,545 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,548 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,548 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,548 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,548 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,548 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,549 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,549 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,549 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,549 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,549 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,549 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,549 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,550 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,550 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,553 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,553 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,553 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,553 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,553 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,555 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,560 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,601 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,603 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,603 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,603 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,603 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,603 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,603 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,611 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,616 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,616 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,616 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,617 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,617 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,618 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,618 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,618 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,618 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,618 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,618 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,618 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,619 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,619 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,624 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,624 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,632 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,632 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,632 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,632 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,632 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,634 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,634 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,640 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,640 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,640 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,640 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,640 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,640 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,642 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,647 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,647 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,647 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,647 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,649 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,649 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,654 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,654 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,654 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,655 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,655 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,655 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,655 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,655 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,655 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,655 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,656 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,656 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,656 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,656 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:47:31 BoogieIcfgContainer [2018-11-10 13:47:31,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:47:31,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:47:31,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:47:31,955 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:47:31,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:35:50" (3/4) ... [2018-11-10 13:47:31,958 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:47:31,993 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,993 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,993 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,993 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,993 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,993 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,995 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,996 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,996 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,996 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,996 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,996 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:31,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,000 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,000 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,001 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,002 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,002 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,002 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,002 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,006 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,011 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,011 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,012 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,012 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,012 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,012 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,013 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,014 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,015 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,015 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,015 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,015 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,015 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,019 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,019 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,019 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,019 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,019 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,019 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,019 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,021 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,021 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,021 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,021 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,021 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,021 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,022 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,027 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,027 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,028 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,029 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,029 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,029 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,034 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,034 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,035 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,036 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,036 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,041 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,054 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,055 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,055 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,055 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,055 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,055 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,078 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,078 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,079 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,080 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,080 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,105 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,106 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,106 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,106 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,106 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,109 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,109 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,109 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,109 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,109 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,109 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,109 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,113 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,113 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,113 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,113 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,135 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,135 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,135 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,135 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,135 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,135 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,136 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,136 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,136 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,136 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,139 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,139 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,139 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,139 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,139 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,139 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,140 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,140 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,140 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,140 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,140 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,140 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,140 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,162 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,164 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,166 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,184 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,184 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,185 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,185 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,185 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,185 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:47:32,456 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ef41455d-8f26-4931-91f0-23884d7bac76/bin-2019/utaipan/witness.graphml [2018-11-10 13:47:32,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:47:32,457 INFO L168 Benchmark]: Toolchain (without parser) took 702549.12 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -272.3 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-11-10 13:47:32,458 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:47:32,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:47:32,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 943.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:47:32,459 INFO L168 Benchmark]: Boogie Preprocessor took 21.61 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:47:32,459 INFO L168 Benchmark]: RCFGBuilder took 256.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:47:32,459 INFO L168 Benchmark]: TraceAbstraction took 701591.71 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.9 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-11-10 13:47:32,460 INFO L168 Benchmark]: Witness Printer took 501.31 ms. Allocated memory is still 5.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:47:32,461 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 943.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.61 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 256.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 701591.71 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.9 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 501.31 ms. Allocated memory is still 5.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 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.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of 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: [L24] int i, b[32]; [L24] RET int i, b[32]; [L25] CALL char mask[32]; [L25] RET char mask[32]; [L26] i = 0 [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND FALSE !(i <= size + 1) [L20] RET return i; [L27] EXPR foo(mask, i) [L27] CALL b[i] = foo(mask, i) [L27] RET b[i] = foo(mask, i) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size + 1 [L18] a[i] [L18] CALL b[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 8 error locations. UNSAFE Result, 701.5s OverallTime, 89 OverallIterations, 591 TraceHistogramMax, 172.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6109 SDtfs, 59812 SDslu, 108767 SDs, 0 SdLazy, 256075 SolverSat, 9104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 207732 GetRequests, 196993 SyntacticMatches, 1404 SemanticMatches, 9335 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 529279 ImplicationChecksByTransitivity, 212.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4396occurred in iteration=88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.4s AbstIntTime, 8 AbstIntIterations, 2 AbstIntStrong, 0.9427280265339967 AbsIntWeakeningRatio, 1.3134328358208955 AbsIntAvgWeakeningVarsNumRemoved, 145.44776119402985 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 88 MinimizatonAttempts, 2788 StatesRemovedByMinimization, 83 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 5.0s SsaConstructionTime, 57.1s SatisfiabilityAnalysisTime, 365.6s InterpolantComputationTime, 205777 NumberOfCodeBlocks, 184764 NumberOfCodeBlocksAsserted, 574 NumberOfCheckSat, 302637 ConstructedInterpolants, 35668 QuantifiedInterpolants, 1781957850 SizeOfPredicates, 614 NumberOfNonLiveVariables, 273588 ConjunctsInSsa, 3593 ConjunctsInUnsatCore, 242 InterpolantComputations, 13 PerfectInterpolantSequences, 43364648/43933478 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...