./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.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_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -s /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 68d161eb03bccd8280d2086bc4cdb7b46f7ee157 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:47:34,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:47:34,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:47:34,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:47:34,537 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:47:34,538 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:47:34,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:47:34,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:47:34,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:47:34,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:47:34,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:47:34,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:47:34,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:47:34,544 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:47:34,545 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:47:34,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:47:34,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:47:34,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:47:34,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:47:34,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:47:34,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:47:34,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:47:34,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:47:34,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:47:34,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:47:34,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:47:34,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:47:34,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:47:34,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:47:34,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:47:34,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:47:34,556 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:47:34,556 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:47:34,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:47:34,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:47:34,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:47:34,558 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 08:47:34,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:47:34,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:47:34,568 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:47:34,568 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 08:47:34,569 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 08:47:34,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 08:47:34,569 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 08:47:34,569 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 08:47:34,569 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 08:47:34,569 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 08:47:34,569 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 08:47:34,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:47:34,570 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:47:34,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:47:34,570 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:47:34,570 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:47:34,570 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:47:34,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:47:34,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:47:34,571 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 08:47:34,571 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 08:47:34,571 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 08:47:34,571 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:47:34,571 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:47:34,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:47:34,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:47:34,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:47:34,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:47:34,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:47:34,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:47:34,572 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:47:34,572 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 08:47:34,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:47:34,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:47:34,573 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_91953a57-c10b-4317-9416-c7327c42a5f9/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 -> 68d161eb03bccd8280d2086bc4cdb7b46f7ee157 [2018-11-10 08:47:34,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:47:34,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:47:34,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:47:34,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:47:34,605 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:47:34,606 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-11-10 08:47:34,643 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/data/8f53a0922/202482ea8aa244da8c0f7045929a61f2/FLAG0dd9b68a8 [2018-11-10 08:47:34,959 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:47:34,959 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-11-10 08:47:34,964 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/data/8f53a0922/202482ea8aa244da8c0f7045929a61f2/FLAG0dd9b68a8 [2018-11-10 08:47:34,974 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/data/8f53a0922/202482ea8aa244da8c0f7045929a61f2 [2018-11-10 08:47:34,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:47:34,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:47:34,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:47:34,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:47:34,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:47:34,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:47:34" (1/1) ... [2018-11-10 08:47:34,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510710f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:34, skipping insertion in model container [2018-11-10 08:47:34,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:47:34" (1/1) ... [2018-11-10 08:47:34,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:47:35,000 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:47:35,097 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:47:35,102 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:47:35,112 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:47:35,121 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:47:35,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35 WrapperNode [2018-11-10 08:47:35,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:47:35,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:47:35,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:47:35,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:47:35,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:47:35,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:47:35,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:47:35,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:47:35,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... [2018-11-10 08:47:35,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:47:35,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:47:35,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:47:35,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:47:35,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:35,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:47:35,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:47:35,244 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 08:47:35,245 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 08:47:35,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:47:35,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:47:35,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:47:35,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:47:35,418 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:47:35,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:47:35 BoogieIcfgContainer [2018-11-10 08:47:35,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:47:35,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:47:35,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:47:35,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:47:35,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:47:34" (1/3) ... [2018-11-10 08:47:35,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b582f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:47:35, skipping insertion in model container [2018-11-10 08:47:35,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:47:35" (2/3) ... [2018-11-10 08:47:35,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b582f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:47:35, skipping insertion in model container [2018-11-10 08:47:35,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:47:35" (3/3) ... [2018-11-10 08:47:35,423 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-11-10 08:47:35,428 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:47:35,432 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 08:47:35,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 08:47:35,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:47:35,463 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 08:47:35,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:47:35,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:47:35,463 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:47:35,463 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:47:35,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:47:35,463 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:47:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 08:47:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 08:47:35,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:35,479 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:35,480 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:35,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-11-10 08:47:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:35,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:35,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:35,573 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 08:47:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:47:35,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:35,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 08:47:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 08:47:35,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:47:35,592 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-10 08:47:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:35,604 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-10 08:47:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:47:35,604 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 08:47:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:35,610 INFO L225 Difference]: With dead ends: 44 [2018-11-10 08:47:35,610 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 08:47:35,611 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 08:47:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 08:47:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 08:47:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 08:47:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-10 08:47:35,633 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-11-10 08:47:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:35,634 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 08:47:35,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 08:47:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-10 08:47:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 08:47:35,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:35,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:35,635 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:35,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-11-10 08:47:35,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:35,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:35,682 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 08:47:35,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:35,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:47:35,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:35,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:47:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:47:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:47:35,685 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-11-10 08:47:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:35,720 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 08:47:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:47:35,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 08:47:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:35,722 INFO L225 Difference]: With dead ends: 61 [2018-11-10 08:47:35,722 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 08:47:35,722 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 08:47:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 08:47:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-11-10 08:47:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 08:47:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-10 08:47:35,730 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-11-10 08:47:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:35,730 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 08:47:35,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:47:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-10 08:47:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 08:47:35,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:35,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:35,732 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:35,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-11-10 08:47:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,733 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:35,767 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 08:47:35,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:35,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:47:35,767 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:35,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:47:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:47:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:47:35,768 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-11-10 08:47:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:35,803 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-10 08:47:35,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:47:35,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 08:47:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:35,805 INFO L225 Difference]: With dead ends: 56 [2018-11-10 08:47:35,805 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 08:47:35,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:47:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 08:47:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-10 08:47:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 08:47:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-10 08:47:35,810 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2018-11-10 08:47:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:35,810 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-10 08:47:35,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:47:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-10 08:47:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 08:47:35,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:35,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:35,811 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:35,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510122, now seen corresponding path program 1 times [2018-11-10 08:47:35,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:35,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,813 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:35,876 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 08:47:35,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:47:35,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:35,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:47:35,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:47:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:47:35,877 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2018-11-10 08:47:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:35,980 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-10 08:47:35,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:47:35,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 08:47:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:35,981 INFO L225 Difference]: With dead ends: 50 [2018-11-10 08:47:35,981 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 08:47:35,982 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 08:47:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 08:47:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-10 08:47:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 08:47:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-10 08:47:35,985 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2018-11-10 08:47:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:35,985 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-10 08:47:35,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:47:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-10 08:47:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:47:35,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:35,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:35,987 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:35,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 646271685, now seen corresponding path program 1 times [2018-11-10 08:47:35,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:35,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:36,062 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 08:47:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:47:36,062 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:36,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:47:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:47:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:47:36,064 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-11-10 08:47:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:36,147 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-10 08:47:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:47:36,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 08:47:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:36,148 INFO L225 Difference]: With dead ends: 49 [2018-11-10 08:47:36,148 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 08:47:36,149 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 08:47:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 08:47:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-10 08:47:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 08:47:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-10 08:47:36,151 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-11-10 08:47:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:36,151 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-10 08:47:36,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:47:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-10 08:47:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:47:36,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:36,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:36,152 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:36,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1750858933, now seen corresponding path program 1 times [2018-11-10 08:47:36,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:36,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:36,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:36,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:36,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:36,190 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 08:47:36,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:36,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:47:36,190 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:36,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:47:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:47:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:47:36,191 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-11-10 08:47:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:36,237 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-10 08:47:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:47:36,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-10 08:47:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:36,238 INFO L225 Difference]: With dead ends: 47 [2018-11-10 08:47:36,238 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 08:47:36,239 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 08:47:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 08:47:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-10 08:47:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 08:47:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-10 08:47:36,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 17 [2018-11-10 08:47:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:36,242 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-10 08:47:36,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:47:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-10 08:47:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 08:47:36,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:36,242 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:36,243 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:36,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1557947998, now seen corresponding path program 1 times [2018-11-10 08:47:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:36,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:36,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:36,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:36,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:36,307 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 08:47:36,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:36,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:47:36,308 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:36,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:47:36,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:47:36,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:47:36,308 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-10 08:47:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:36,369 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-10 08:47:36,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:47:36,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-10 08:47:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:36,370 INFO L225 Difference]: With dead ends: 66 [2018-11-10 08:47:36,370 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 08:47:36,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 08:47:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 08:47:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2018-11-10 08:47:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 08:47:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-10 08:47:36,375 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-11-10 08:47:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:36,375 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 08:47:36,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:47:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-10 08:47:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 08:47:36,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:36,376 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 08:47:36,376 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:36,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash -361022790, now seen corresponding path program 1 times [2018-11-10 08:47:36,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:36,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:36,378 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:47:36,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:36,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:36,411 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 08:47:36,412 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [15], [17], [19], [28], [32], [37], [77], [78], [79], [81] [2018-11-10 08:47:36,449 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:47:36,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:47:36,685 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:47:36,686 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 08:47:36,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:36,696 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:47:36,811 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 81.4% of their original sizes. [2018-11-10 08:47:36,812 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:47:36,939 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 08:47:36,939 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:47:36,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:47:36,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [3] total 11 [2018-11-10 08:47:36,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:36,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:47:36,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:47:36,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:47:36,941 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 10 states. [2018-11-10 08:47:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:37,460 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-10 08:47:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:47:37,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-10 08:47:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:37,462 INFO L225 Difference]: With dead ends: 70 [2018-11-10 08:47:37,463 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 08:47:37,463 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:47:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 08:47:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2018-11-10 08:47:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 08:47:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-10 08:47:37,468 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 19 [2018-11-10 08:47:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:37,469 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-10 08:47:37,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:47:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-11-10 08:47:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:47:37,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:37,470 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:37,474 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:37,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1263490023, now seen corresponding path program 1 times [2018-11-10 08:47:37,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:37,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:37,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:37,585 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 08:47:37,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:37,586 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:37,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-10 08:47:37,586 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [42], [77], [78], [79], [81], [82] [2018-11-10 08:47:37,588 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:47:37,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:47:37,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:47:37,700 INFO L272 AbstractInterpreter]: Visited 23 different actions 46 times. Merged at 13 different actions 21 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-10 08:47:37,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:37,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:47:37,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:37,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:37,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:37,709 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:37,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:37,792 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 08:47:37,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:37,880 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 08:47:37,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:37,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-10 08:47:37,909 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:37,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:47:37,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:47:37,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:47:37,909 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 9 states. [2018-11-10 08:47:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:38,004 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-10 08:47:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:47:38,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-10 08:47:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:38,005 INFO L225 Difference]: With dead ends: 101 [2018-11-10 08:47:38,005 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 08:47:38,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:47:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 08:47:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2018-11-10 08:47:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 08:47:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-10 08:47:38,008 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 24 [2018-11-10 08:47:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:38,009 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-10 08:47:38,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:47:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-10 08:47:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 08:47:38,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:38,009 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 08:47:38,010 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:38,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:38,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1873660240, now seen corresponding path program 2 times [2018-11-10 08:47:38,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:38,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:38,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:38,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:38,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:38,053 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 08:47:38,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:38,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:47:38,053 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:38,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:47:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:47:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:47:38,054 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-10 08:47:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:38,102 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-10 08:47:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:47:38,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-10 08:47:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:38,103 INFO L225 Difference]: With dead ends: 92 [2018-11-10 08:47:38,103 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 08:47:38,103 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 08:47:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 08:47:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-11-10 08:47:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 08:47:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-11-10 08:47:38,107 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 30 [2018-11-10 08:47:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:38,107 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-11-10 08:47:38,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:47:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-10 08:47:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 08:47:38,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:38,108 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 08:47:38,108 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:38,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1498621564, now seen corresponding path program 1 times [2018-11-10 08:47:38,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:38,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:38,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:38,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:38,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:38,152 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 08:47:38,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:47:38,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:47:38,153 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:47:38,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:47:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:47:38,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:47:38,153 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-11-10 08:47:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:38,185 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-10 08:47:38,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:47:38,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-10 08:47:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:38,186 INFO L225 Difference]: With dead ends: 71 [2018-11-10 08:47:38,186 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 08:47:38,186 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 08:47:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 08:47:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-10 08:47:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 08:47:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-10 08:47:38,188 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 37 [2018-11-10 08:47:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:38,189 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-10 08:47:38,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:47:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-10 08:47:38,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 08:47:38,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:38,189 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 08:47:38,190 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:38,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash 787371864, now seen corresponding path program 1 times [2018-11-10 08:47:38,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:38,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:38,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:38,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:47:38,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:38,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:38,290 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-10 08:47:38,290 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 08:47:38,292 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:47:38,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:47:40,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:47:40,548 INFO L272 AbstractInterpreter]: Visited 30 different actions 977 times. Merged at 16 different actions 735 times. Widened at 2 different actions 26 times. Found 55 fixpoints after 5 different actions. Largest state had 30 variables. [2018-11-10 08:47:40,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:40,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:47:40,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:40,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:40,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:40,560 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:40,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:40,604 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 08:47:40,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:40,619 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 08:47:40,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:40,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2018-11-10 08:47:40,645 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:40,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:47:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:47:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:47:40,646 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 10 states. [2018-11-10 08:47:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:40,730 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-10 08:47:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 08:47:40,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-10 08:47:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:40,731 INFO L225 Difference]: With dead ends: 85 [2018-11-10 08:47:40,731 INFO L226 Difference]: Without dead ends: 85 [2018-11-10 08:47:40,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:47:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-10 08:47:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-11-10 08:47:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 08:47:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-10 08:47:40,734 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 38 [2018-11-10 08:47:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:40,735 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-10 08:47:40,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:47:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-10 08:47:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 08:47:40,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:40,736 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:40,736 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:40,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1651723212, now seen corresponding path program 1 times [2018-11-10 08:47:40,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:40,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:40,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 08:47:40,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:40,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:40,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-10 08:47:40,773 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 08:47:40,774 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:47:40,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:47:43,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:47:43,375 INFO L272 AbstractInterpreter]: Visited 25 different actions 1034 times. Merged at 16 different actions 735 times. Widened at 2 different actions 26 times. Found 55 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-10 08:47:43,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:43,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:47:43,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:43,382 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:43,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:43,396 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:43,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 08:47:43,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 08:47:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:43,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-11-10 08:47:43,507 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:43,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:47:43,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:47:43,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:47:43,508 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 4 states. [2018-11-10 08:47:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:43,554 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-10 08:47:43,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:47:43,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-10 08:47:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:43,555 INFO L225 Difference]: With dead ends: 65 [2018-11-10 08:47:43,555 INFO L226 Difference]: Without dead ends: 65 [2018-11-10 08:47:43,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:47:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-10 08:47:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-10 08:47:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 08:47:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-10 08:47:43,558 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 44 [2018-11-10 08:47:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:43,559 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-10 08:47:43,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:47:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-10 08:47:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 08:47:43,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:43,560 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 08:47:43,560 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:43,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1786608099, now seen corresponding path program 2 times [2018-11-10 08:47:43,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:43,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 08:47:43,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:43,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:43,622 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:43,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:43,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:43,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:43,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:47:43,636 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:47:43,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 08:47:43,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:43,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:47:43,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 37 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:47:43,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:43,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 18 [2018-11-10 08:47:43,895 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:43,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 08:47:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:47:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-11-10 08:47:43,896 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 12 states. [2018-11-10 08:47:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:44,071 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-11-10 08:47:44,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:47:44,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-10 08:47:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:44,073 INFO L225 Difference]: With dead ends: 123 [2018-11-10 08:47:44,073 INFO L226 Difference]: Without dead ends: 123 [2018-11-10 08:47:44,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:47:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-10 08:47:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2018-11-10 08:47:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 08:47:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-11-10 08:47:44,077 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 50 [2018-11-10 08:47:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:44,077 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-11-10 08:47:44,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 08:47:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-11-10 08:47:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 08:47:44,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:44,082 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 08:47:44,082 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:44,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1137911390, now seen corresponding path program 1 times [2018-11-10 08:47:44,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:44,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:44,083 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 08:47:44,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:44,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:44,185 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 08:47:44,185 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 08:47:44,194 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:47:44,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:47:46,131 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:47:46,131 INFO L272 AbstractInterpreter]: Visited 25 different actions 1006 times. Merged at 17 different actions 782 times. Widened at 2 different actions 26 times. Found 55 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-10 08:47:46,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:46,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:47:46,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:46,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:46,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:46,147 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:46,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:46,221 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 08:47:46,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:46,304 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 08:47:46,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:46,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 18 [2018-11-10 08:47:46,321 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:46,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 08:47:46,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 08:47:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-10 08:47:46,321 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 15 states. [2018-11-10 08:47:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:46,446 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-11-10 08:47:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 08:47:46,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-10 08:47:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:46,447 INFO L225 Difference]: With dead ends: 118 [2018-11-10 08:47:46,447 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 08:47:46,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-11-10 08:47:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 08:47:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-10 08:47:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 08:47:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-10 08:47:46,450 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 55 [2018-11-10 08:47:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:46,450 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-10 08:47:46,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 08:47:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-10 08:47:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 08:47:46,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:46,451 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 08:47:46,451 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:46,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1312166887, now seen corresponding path program 2 times [2018-11-10 08:47:46,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:46,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:46,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:46,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:46,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:46,524 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 08:47:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:46,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:46,524 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:46,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:46,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:47:46,538 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:47:46,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 08:47:46,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:46,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:46,604 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 08:47:46,608 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 08:47:46,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:47:46,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:47:46,624 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 08:47:46,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 08:47:46,645 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 08:47:46,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-11-10 08:47:46,736 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 08:47:46,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:46,775 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 08:47:46,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:46,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2018-11-10 08:47:46,792 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:46,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 08:47:46,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:47:46,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-10 08:47:46,792 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 12 states. [2018-11-10 08:47:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:46,939 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-11-10 08:47:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 08:47:46,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-10 08:47:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:46,940 INFO L225 Difference]: With dead ends: 99 [2018-11-10 08:47:46,941 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 08:47:46,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-11-10 08:47:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 08:47:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2018-11-10 08:47:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 08:47:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-11-10 08:47:46,944 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 61 [2018-11-10 08:47:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:46,944 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-11-10 08:47:46,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 08:47:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-10 08:47:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 08:47:46,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:46,947 INFO L375 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:46,947 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:46,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2040483535, now seen corresponding path program 3 times [2018-11-10 08:47:46,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:46,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:46,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 135 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-10 08:47:47,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:47,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:47,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:47,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:47,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:47,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:47,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:47:47,030 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:47:47,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:47:47,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:47,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 08:47:47,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 08:47:47,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:47,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2018-11-10 08:47:47,175 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:47,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 08:47:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 08:47:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-10 08:47:47,176 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 14 states. [2018-11-10 08:47:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:47,327 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2018-11-10 08:47:47,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 08:47:47,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-11-10 08:47:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:47,328 INFO L225 Difference]: With dead ends: 186 [2018-11-10 08:47:47,329 INFO L226 Difference]: Without dead ends: 186 [2018-11-10 08:47:47,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:47:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-10 08:47:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 128. [2018-11-10 08:47:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 08:47:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2018-11-10 08:47:47,333 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 87 [2018-11-10 08:47:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:47,333 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2018-11-10 08:47:47,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 08:47:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2018-11-10 08:47:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 08:47:47,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:47,335 INFO L375 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:47,335 INFO L424 AbstractCegarLoop]: === Iteration 18 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:47,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:47,335 INFO L82 PathProgramCache]: Analyzing trace with hash -707995791, now seen corresponding path program 4 times [2018-11-10 08:47:47,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:47,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:47,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:47,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:47,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 337 proven. 123 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 08:47:47,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:47,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:47,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:47,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:47,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:47,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:47,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:47,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:47,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-10 08:47:47,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-10 08:47:47,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:47,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 27 [2018-11-10 08:47:47,726 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:47,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 08:47:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 08:47:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-11-10 08:47:47,727 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 23 states. [2018-11-10 08:47:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:48,021 INFO L93 Difference]: Finished difference Result 206 states and 211 transitions. [2018-11-10 08:47:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 08:47:48,021 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2018-11-10 08:47:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:48,022 INFO L225 Difference]: With dead ends: 206 [2018-11-10 08:47:48,022 INFO L226 Difference]: Without dead ends: 200 [2018-11-10 08:47:48,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 233 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 08:47:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-10 08:47:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2018-11-10 08:47:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-10 08:47:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 190 transitions. [2018-11-10 08:47:48,027 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 190 transitions. Word has length 124 [2018-11-10 08:47:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:48,028 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 190 transitions. [2018-11-10 08:47:48,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 08:47:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2018-11-10 08:47:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 08:47:48,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:48,029 INFO L375 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:48,030 INFO L424 AbstractCegarLoop]: === Iteration 19 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:48,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2143880058, now seen corresponding path program 5 times [2018-11-10 08:47:48,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:48,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:48,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:48,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:48,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 320 proven. 34 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-10 08:47:48,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:48,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:48,141 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:48,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:48,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:48,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:48,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:47:48,148 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:47:48,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 08:47:48,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:48,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 293 proven. 34 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-10 08:47:48,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 276 proven. 51 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-10 08:47:48,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:48,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 24 [2018-11-10 08:47:48,322 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:48,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 08:47:48,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 08:47:48,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:47:48,323 INFO L87 Difference]: Start difference. First operand 186 states and 190 transitions. Second operand 16 states. [2018-11-10 08:47:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:48,490 INFO L93 Difference]: Finished difference Result 238 states and 243 transitions. [2018-11-10 08:47:48,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 08:47:48,490 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 130 [2018-11-10 08:47:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:48,491 INFO L225 Difference]: With dead ends: 238 [2018-11-10 08:47:48,491 INFO L226 Difference]: Without dead ends: 238 [2018-11-10 08:47:48,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 08:47:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-10 08:47:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 223. [2018-11-10 08:47:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-10 08:47:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 228 transitions. [2018-11-10 08:47:48,496 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 228 transitions. Word has length 130 [2018-11-10 08:47:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:48,496 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 228 transitions. [2018-11-10 08:47:48,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 08:47:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 228 transitions. [2018-11-10 08:47:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 08:47:48,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:48,498 INFO L375 BasicCegarLoop]: trace histogram [22, 18, 17, 17, 17, 17, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:48,498 INFO L424 AbstractCegarLoop]: === Iteration 20 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:48,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:48,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1411280584, now seen corresponding path program 6 times [2018-11-10 08:47:48,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:48,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:48,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:48,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 657 proven. 235 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-11-10 08:47:48,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:48,654 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:48,654 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:48,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:48,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:48,654 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:48,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:47:48,660 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:47:48,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:47:48,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:48,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 659 proven. 233 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-11-10 08:47:48,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 667 proven. 225 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-11-10 08:47:48,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:48,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2018-11-10 08:47:48,963 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:48,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 08:47:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 08:47:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2018-11-10 08:47:48,964 INFO L87 Difference]: Start difference. First operand 223 states and 228 transitions. Second operand 23 states. [2018-11-10 08:47:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:49,176 INFO L93 Difference]: Finished difference Result 264 states and 270 transitions. [2018-11-10 08:47:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 08:47:49,177 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 167 [2018-11-10 08:47:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:49,178 INFO L225 Difference]: With dead ends: 264 [2018-11-10 08:47:49,178 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 08:47:49,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 314 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 08:47:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 08:47:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 235. [2018-11-10 08:47:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-10 08:47:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 240 transitions. [2018-11-10 08:47:49,183 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 240 transitions. Word has length 167 [2018-11-10 08:47:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:49,184 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 240 transitions. [2018-11-10 08:47:49,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 08:47:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 240 transitions. [2018-11-10 08:47:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:47:49,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:49,185 INFO L375 BasicCegarLoop]: trace histogram [24, 20, 19, 19, 19, 19, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:49,185 INFO L424 AbstractCegarLoop]: === Iteration 21 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:49,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:49,186 INFO L82 PathProgramCache]: Analyzing trace with hash -518487064, now seen corresponding path program 7 times [2018-11-10 08:47:49,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:49,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:49,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 536 proven. 59 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2018-11-10 08:47:49,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:49,312 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:49,312 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:49,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:49,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:49,312 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:49,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:49,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:49,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-11-10 08:47:49,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-11-10 08:47:49,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:49,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2018-11-10 08:47:49,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:49,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 08:47:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 08:47:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-11-10 08:47:49,552 INFO L87 Difference]: Start difference. First operand 235 states and 240 transitions. Second operand 18 states. [2018-11-10 08:47:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:49,800 INFO L93 Difference]: Finished difference Result 345 states and 356 transitions. [2018-11-10 08:47:49,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 08:47:49,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2018-11-10 08:47:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:49,801 INFO L225 Difference]: With dead ends: 345 [2018-11-10 08:47:49,801 INFO L226 Difference]: Without dead ends: 345 [2018-11-10 08:47:49,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 08:47:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-10 08:47:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 284. [2018-11-10 08:47:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-10 08:47:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 291 transitions. [2018-11-10 08:47:49,807 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 291 transitions. Word has length 179 [2018-11-10 08:47:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:49,807 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 291 transitions. [2018-11-10 08:47:49,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 08:47:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 291 transitions. [2018-11-10 08:47:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-10 08:47:49,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:49,808 INFO L375 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:49,808 INFO L424 AbstractCegarLoop]: === Iteration 22 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:49,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:49,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2015042296, now seen corresponding path program 8 times [2018-11-10 08:47:49,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:49,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:49,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:49,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:49,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2285 backedges. 1242 proven. 291 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-11-10 08:47:49,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:49,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:49,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:49,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:49,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:49,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:49,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:47:49,989 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:47:50,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 08:47:50,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:50,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2285 backedges. 811 proven. 108 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2018-11-10 08:47:50,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2285 backedges. 811 proven. 108 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2018-11-10 08:47:50,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:50,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 9] total 36 [2018-11-10 08:47:50,295 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:50,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 08:47:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 08:47:50,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 08:47:50,296 INFO L87 Difference]: Start difference. First operand 284 states and 291 transitions. Second operand 28 states. [2018-11-10 08:47:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:50,749 INFO L93 Difference]: Finished difference Result 519 states and 538 transitions. [2018-11-10 08:47:50,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 08:47:50,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 228 [2018-11-10 08:47:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:50,751 INFO L225 Difference]: With dead ends: 519 [2018-11-10 08:47:50,751 INFO L226 Difference]: Without dead ends: 519 [2018-11-10 08:47:50,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=2412, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 08:47:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-11-10 08:47:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 473. [2018-11-10 08:47:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-11-10 08:47:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 490 transitions. [2018-11-10 08:47:50,764 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 490 transitions. Word has length 228 [2018-11-10 08:47:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:50,764 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 490 transitions. [2018-11-10 08:47:50,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 08:47:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 490 transitions. [2018-11-10 08:47:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 08:47:50,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:50,765 INFO L375 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:50,765 INFO L424 AbstractCegarLoop]: === Iteration 23 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:50,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:50,765 INFO L82 PathProgramCache]: Analyzing trace with hash -319365336, now seen corresponding path program 9 times [2018-11-10 08:47:50,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:50,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:50,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:50,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:50,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2617 backedges. 1112 proven. 105 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-10 08:47:50,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:50,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:50,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:50,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:50,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:50,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:50,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:47:50,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:47:50,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:47:50,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:50,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2617 backedges. 1043 proven. 472 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2018-11-10 08:47:51,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2617 backedges. 1043 proven. 472 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2018-11-10 08:47:51,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:51,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 34 [2018-11-10 08:47:51,389 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:51,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 08:47:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 08:47:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 08:47:51,391 INFO L87 Difference]: Start difference. First operand 473 states and 490 transitions. Second operand 31 states. [2018-11-10 08:47:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:51,836 INFO L93 Difference]: Finished difference Result 606 states and 626 transitions. [2018-11-10 08:47:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 08:47:51,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 240 [2018-11-10 08:47:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:51,839 INFO L225 Difference]: With dead ends: 606 [2018-11-10 08:47:51,840 INFO L226 Difference]: Without dead ends: 606 [2018-11-10 08:47:51,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 448 SyntacticMatches, 17 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1874, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 08:47:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-11-10 08:47:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 586. [2018-11-10 08:47:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-11-10 08:47:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 606 transitions. [2018-11-10 08:47:51,851 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 606 transitions. Word has length 240 [2018-11-10 08:47:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:51,851 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 606 transitions. [2018-11-10 08:47:51,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 08:47:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 606 transitions. [2018-11-10 08:47:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-11-10 08:47:51,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:51,852 INFO L375 BasicCegarLoop]: trace histogram [39, 33, 32, 32, 32, 32, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:51,852 INFO L424 AbstractCegarLoop]: === Iteration 24 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:51,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:51,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1450381567, now seen corresponding path program 10 times [2018-11-10 08:47:51,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:51,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:51,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3687 backedges. 1688 proven. 540 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2018-11-10 08:47:52,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:52,060 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:52,060 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:52,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:52,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:52,060 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:52,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:52,067 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:52,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3687 backedges. 2376 proven. 70 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2018-11-10 08:47:52,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3687 backedges. 1851 proven. 277 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2018-11-10 08:47:52,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:52,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 39 [2018-11-10 08:47:52,572 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:52,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 08:47:52,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 08:47:52,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 08:47:52,573 INFO L87 Difference]: Start difference. First operand 586 states and 606 transitions. Second operand 33 states. [2018-11-10 08:47:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:53,078 INFO L93 Difference]: Finished difference Result 609 states and 625 transitions. [2018-11-10 08:47:53,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 08:47:53,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 283 [2018-11-10 08:47:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:53,080 INFO L225 Difference]: With dead ends: 609 [2018-11-10 08:47:53,080 INFO L226 Difference]: Without dead ends: 600 [2018-11-10 08:47:53,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 543 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=671, Invalid=3361, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 08:47:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-11-10 08:47:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 479. [2018-11-10 08:47:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-11-10 08:47:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 490 transitions. [2018-11-10 08:47:53,090 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 490 transitions. Word has length 283 [2018-11-10 08:47:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:53,091 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 490 transitions. [2018-11-10 08:47:53,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 08:47:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 490 transitions. [2018-11-10 08:47:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-10 08:47:53,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:53,092 INFO L375 BasicCegarLoop]: trace histogram [40, 34, 33, 33, 33, 33, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:53,093 INFO L424 AbstractCegarLoop]: === Iteration 25 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:53,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:53,093 INFO L82 PathProgramCache]: Analyzing trace with hash 447504150, now seen corresponding path program 11 times [2018-11-10 08:47:53,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:53,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:53,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3894 backedges. 2002 proven. 402 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2018-11-10 08:47:53,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:53,427 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:53,427 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:53,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:53,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:53,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:53,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:47:53,435 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:47:53,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 08:47:53,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:53,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3894 backedges. 1901 proven. 395 refuted. 0 times theorem prover too weak. 1598 trivial. 0 not checked. [2018-11-10 08:47:53,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3894 backedges. 1869 proven. 427 refuted. 0 times theorem prover too weak. 1598 trivial. 0 not checked. [2018-11-10 08:47:54,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:54,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 47 [2018-11-10 08:47:54,093 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:54,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 08:47:54,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 08:47:54,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1794, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 08:47:54,094 INFO L87 Difference]: Start difference. First operand 479 states and 490 transitions. Second operand 32 states. [2018-11-10 08:47:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:54,651 INFO L93 Difference]: Finished difference Result 670 states and 687 transitions. [2018-11-10 08:47:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 08:47:54,652 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 289 [2018-11-10 08:47:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:54,654 INFO L225 Difference]: With dead ends: 670 [2018-11-10 08:47:54,654 INFO L226 Difference]: Without dead ends: 670 [2018-11-10 08:47:54,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 553 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1109, Invalid=3583, Unknown=0, NotChecked=0, Total=4692 [2018-11-10 08:47:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-10 08:47:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 540. [2018-11-10 08:47:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-10 08:47:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 553 transitions. [2018-11-10 08:47:54,670 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 553 transitions. Word has length 289 [2018-11-10 08:47:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:54,671 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 553 transitions. [2018-11-10 08:47:54,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 08:47:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 553 transitions. [2018-11-10 08:47:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-10 08:47:54,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:54,675 INFO L375 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:54,675 INFO L424 AbstractCegarLoop]: === Iteration 26 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:54,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash 100283103, now seen corresponding path program 12 times [2018-11-10 08:47:54,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:54,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:54,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:54,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:54,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 1349 proven. 130 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-11-10 08:47:54,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:54,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:54,859 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:54,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:54,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:54,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:54,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:47:54,869 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:47:54,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:47:54,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:54,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-10 08:47:55,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-10 08:47:55,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:55,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2018-11-10 08:47:55,324 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:55,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 08:47:55,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 08:47:55,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-11-10 08:47:55,325 INFO L87 Difference]: Start difference. First operand 540 states and 553 transitions. Second operand 22 states. [2018-11-10 08:47:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:55,804 INFO L93 Difference]: Finished difference Result 695 states and 714 transitions. [2018-11-10 08:47:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 08:47:55,804 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 295 [2018-11-10 08:47:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:55,806 INFO L225 Difference]: With dead ends: 695 [2018-11-10 08:47:55,807 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 08:47:55,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 08:47:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 08:47:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 659. [2018-11-10 08:47:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-10 08:47:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 677 transitions. [2018-11-10 08:47:55,818 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 677 transitions. Word has length 295 [2018-11-10 08:47:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:55,819 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 677 transitions. [2018-11-10 08:47:55,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 08:47:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 677 transitions. [2018-11-10 08:47:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-10 08:47:55,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:55,821 INFO L375 BasicCegarLoop]: trace histogram [49, 42, 41, 41, 41, 41, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:55,822 INFO L424 AbstractCegarLoop]: === Iteration 27 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:55,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:55,822 INFO L82 PathProgramCache]: Analyzing trace with hash 669527432, now seen corresponding path program 13 times [2018-11-10 08:47:55,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:55,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:55,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 2588 proven. 733 refuted. 0 times theorem prover too weak. 2611 trivial. 0 not checked. [2018-11-10 08:47:56,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:56,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:56,172 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:56,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:56,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:56,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:56,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:56,184 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:47:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:56,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 3710 proven. 102 refuted. 0 times theorem prover too weak. 2120 trivial. 0 not checked. [2018-11-10 08:47:56,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 2822 proven. 385 refuted. 0 times theorem prover too weak. 2725 trivial. 0 not checked. [2018-11-10 08:47:56,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:56,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 16] total 44 [2018-11-10 08:47:56,887 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:56,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-10 08:47:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 08:47:56,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 08:47:56,888 INFO L87 Difference]: Start difference. First operand 659 states and 677 transitions. Second operand 37 states. [2018-11-10 08:47:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:57,447 INFO L93 Difference]: Finished difference Result 700 states and 717 transitions. [2018-11-10 08:47:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 08:47:57,447 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 350 [2018-11-10 08:47:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:57,449 INFO L225 Difference]: With dead ends: 700 [2018-11-10 08:47:57,449 INFO L226 Difference]: Without dead ends: 691 [2018-11-10 08:47:57,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 673 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=862, Invalid=4394, Unknown=0, NotChecked=0, Total=5256 [2018-11-10 08:47:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-10 08:47:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 676. [2018-11-10 08:47:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-11-10 08:47:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 691 transitions. [2018-11-10 08:47:57,457 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 691 transitions. Word has length 350 [2018-11-10 08:47:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:57,458 INFO L481 AbstractCegarLoop]: Abstraction has 676 states and 691 transitions. [2018-11-10 08:47:57,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-10 08:47:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 691 transitions. [2018-11-10 08:47:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-10 08:47:57,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:57,460 INFO L375 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:57,460 INFO L424 AbstractCegarLoop]: === Iteration 28 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:57,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1967071649, now seen corresponding path program 14 times [2018-11-10 08:47:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:47:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:57,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 3015 proven. 531 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-10 08:47:57,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:57,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:57,709 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:57,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:57,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:57,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:57,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:47:57,718 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:47:57,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-10 08:47:57,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:57,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2876 proven. 523 refuted. 0 times theorem prover too weak. 2796 trivial. 0 not checked. [2018-11-10 08:47:58,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2839 proven. 560 refuted. 0 times theorem prover too weak. 2796 trivial. 0 not checked. [2018-11-10 08:47:58,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:58,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 17] total 51 [2018-11-10 08:47:58,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:58,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 08:47:58,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 08:47:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 08:47:58,426 INFO L87 Difference]: Start difference. First operand 676 states and 691 transitions. Second operand 35 states. [2018-11-10 08:47:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:47:58,908 INFO L93 Difference]: Finished difference Result 762 states and 779 transitions. [2018-11-10 08:47:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 08:47:58,909 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 356 [2018-11-10 08:47:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:47:58,911 INFO L225 Difference]: With dead ends: 762 [2018-11-10 08:47:58,911 INFO L226 Difference]: Without dead ends: 762 [2018-11-10 08:47:58,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 685 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1370, Invalid=4330, Unknown=0, NotChecked=0, Total=5700 [2018-11-10 08:47:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-10 08:47:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 613. [2018-11-10 08:47:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-10 08:47:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 626 transitions. [2018-11-10 08:47:58,922 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 626 transitions. Word has length 356 [2018-11-10 08:47:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:47:58,923 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 626 transitions. [2018-11-10 08:47:58,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 08:47:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 626 transitions. [2018-11-10 08:47:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-10 08:47:58,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:47:58,926 INFO L375 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:47:58,926 INFO L424 AbstractCegarLoop]: === Iteration 29 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:47:58,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:47:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash -659936792, now seen corresponding path program 15 times [2018-11-10 08:47:58,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:47:58,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:58,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:47:58,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:47:58,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:47:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:47:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6464 backedges. 2102 proven. 176 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-11-10 08:47:59,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:59,194 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:47:59,195 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:47:59,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:47:59,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:47:59,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:47:59,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:47:59,202 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:47:59,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:47:59,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:47:59,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:47:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6464 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4361 trivial. 0 not checked. [2018-11-10 08:47:59,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:47:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6464 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4361 trivial. 0 not checked. [2018-11-10 08:47:59,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:47:59,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 38 [2018-11-10 08:47:59,631 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:47:59,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 08:47:59,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 08:47:59,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 08:47:59,632 INFO L87 Difference]: Start difference. First operand 613 states and 626 transitions. Second operand 30 states. [2018-11-10 08:48:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:00,119 INFO L93 Difference]: Finished difference Result 776 states and 795 transitions. [2018-11-10 08:48:00,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 08:48:00,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 362 [2018-11-10 08:48:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:00,122 INFO L225 Difference]: With dead ends: 776 [2018-11-10 08:48:00,122 INFO L226 Difference]: Without dead ends: 776 [2018-11-10 08:48:00,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 706 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=2091, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 08:48:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-11-10 08:48:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 744. [2018-11-10 08:48:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-10 08:48:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 762 transitions. [2018-11-10 08:48:00,133 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 762 transitions. Word has length 362 [2018-11-10 08:48:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:00,133 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 762 transitions. [2018-11-10 08:48:00,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 08:48:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 762 transitions. [2018-11-10 08:48:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-11-10 08:48:00,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:00,136 INFO L375 BasicCegarLoop]: trace histogram [60, 52, 51, 51, 51, 51, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:00,137 INFO L424 AbstractCegarLoop]: === Iteration 30 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:00,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash -283822410, now seen corresponding path program 16 times [2018-11-10 08:48:00,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:00,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:00,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:00,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9031 backedges. 3759 proven. 956 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2018-11-10 08:48:00,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:00,453 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:00,453 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:00,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:00,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:00,453 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:00,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:00,460 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:00,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9031 backedges. 5454 proven. 140 refuted. 0 times theorem prover too weak. 3437 trivial. 0 not checked. [2018-11-10 08:48:00,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9031 backedges. 4077 proven. 511 refuted. 0 times theorem prover too weak. 4443 trivial. 0 not checked. [2018-11-10 08:48:01,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:01,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 18] total 49 [2018-11-10 08:48:01,114 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:01,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-10 08:48:01,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 08:48:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1980, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 08:48:01,115 INFO L87 Difference]: Start difference. First operand 744 states and 762 transitions. Second operand 41 states. [2018-11-10 08:48:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:01,740 INFO L93 Difference]: Finished difference Result 641 states and 652 transitions. [2018-11-10 08:48:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-10 08:48:01,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 423 [2018-11-10 08:48:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:01,742 INFO L225 Difference]: With dead ends: 641 [2018-11-10 08:48:01,742 INFO L226 Difference]: Without dead ends: 632 [2018-11-10 08:48:01,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 815 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1065, Invalid=5415, Unknown=0, NotChecked=0, Total=6480 [2018-11-10 08:48:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-10 08:48:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2018-11-10 08:48:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-11-10 08:48:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 630 transitions. [2018-11-10 08:48:01,749 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 630 transitions. Word has length 423 [2018-11-10 08:48:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:01,750 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 630 transitions. [2018-11-10 08:48:01,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-10 08:48:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 630 transitions. [2018-11-10 08:48:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-11-10 08:48:01,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:01,752 INFO L375 BasicCegarLoop]: trace histogram [61, 53, 52, 52, 52, 52, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:01,752 INFO L424 AbstractCegarLoop]: === Iteration 31 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:01,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash 609753741, now seen corresponding path program 17 times [2018-11-10 08:48:01,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:01,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:01,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9356 backedges. 4317 proven. 678 refuted. 0 times theorem prover too weak. 4361 trivial. 0 not checked. [2018-11-10 08:48:02,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:02,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:02,036 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:02,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:02,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:02,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:02,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:02,046 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:02,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 08:48:02,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:02,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9356 backedges. 4134 proven. 669 refuted. 0 times theorem prover too weak. 4553 trivial. 0 not checked. [2018-11-10 08:48:02,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9356 backedges. 4092 proven. 711 refuted. 0 times theorem prover too weak. 4553 trivial. 0 not checked. [2018-11-10 08:48:02,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:02,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 18] total 55 [2018-11-10 08:48:02,889 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:02,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-10 08:48:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-10 08:48:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=2435, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 08:48:02,890 INFO L87 Difference]: Start difference. First operand 619 states and 630 transitions. Second operand 38 states. [2018-11-10 08:48:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:03,513 INFO L93 Difference]: Finished difference Result 708 states and 721 transitions. [2018-11-10 08:48:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 08:48:03,514 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 429 [2018-11-10 08:48:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:03,516 INFO L225 Difference]: With dead ends: 708 [2018-11-10 08:48:03,516 INFO L226 Difference]: Without dead ends: 708 [2018-11-10 08:48:03,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 829 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1660, Invalid=5146, Unknown=0, NotChecked=0, Total=6806 [2018-11-10 08:48:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-11-10 08:48:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 692. [2018-11-10 08:48:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-11-10 08:48:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 705 transitions. [2018-11-10 08:48:03,523 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 705 transitions. Word has length 429 [2018-11-10 08:48:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:03,524 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 705 transitions. [2018-11-10 08:48:03,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-10 08:48:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 705 transitions. [2018-11-10 08:48:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-11-10 08:48:03,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:03,526 INFO L375 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:03,527 INFO L424 AbstractCegarLoop]: === Iteration 32 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:03,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -112525802, now seen corresponding path program 18 times [2018-11-10 08:48:03,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:03,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:03,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:03,528 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9687 backedges. 2718 proven. 229 refuted. 0 times theorem prover too weak. 6740 trivial. 0 not checked. [2018-11-10 08:48:03,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:03,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:03,710 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:03,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:03,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:03,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:48:03,722 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:48:03,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:48:03,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:03,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9687 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6776 trivial. 0 not checked. [2018-11-10 08:48:04,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9687 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6776 trivial. 0 not checked. [2018-11-10 08:48:04,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:04,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2018-11-10 08:48:04,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:04,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 08:48:04,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 08:48:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 08:48:04,246 INFO L87 Difference]: Start difference. First operand 692 states and 705 transitions. Second operand 26 states. [2018-11-10 08:48:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:04,830 INFO L93 Difference]: Finished difference Result 871 states and 890 transitions. [2018-11-10 08:48:04,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 08:48:04,830 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 435 [2018-11-10 08:48:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:04,833 INFO L225 Difference]: With dead ends: 871 [2018-11-10 08:48:04,833 INFO L226 Difference]: Without dead ends: 871 [2018-11-10 08:48:04,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=483, Invalid=1967, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 08:48:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-11-10 08:48:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 835. [2018-11-10 08:48:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-11-10 08:48:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 853 transitions. [2018-11-10 08:48:04,844 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 853 transitions. Word has length 435 [2018-11-10 08:48:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:04,844 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 853 transitions. [2018-11-10 08:48:04,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 08:48:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 853 transitions. [2018-11-10 08:48:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-11-10 08:48:04,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:04,848 INFO L375 BasicCegarLoop]: trace histogram [72, 63, 62, 62, 62, 62, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:04,848 INFO L424 AbstractCegarLoop]: === Iteration 33 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:04,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1175251745, now seen corresponding path program 19 times [2018-11-10 08:48:04,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:04,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:04,849 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13170 backedges. 5237 proven. 1209 refuted. 0 times theorem prover too weak. 6724 trivial. 0 not checked. [2018-11-10 08:48:05,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:05,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:05,228 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:05,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:05,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:05,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:05,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:05,234 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:05,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13170 backedges. 7662 proven. 184 refuted. 0 times theorem prover too weak. 5324 trivial. 0 not checked. [2018-11-10 08:48:05,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13170 backedges. 5652 proven. 655 refuted. 0 times theorem prover too weak. 6863 trivial. 0 not checked. [2018-11-10 08:48:06,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:06,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 20] total 54 [2018-11-10 08:48:06,153 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:06,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-10 08:48:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 08:48:06,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=2410, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 08:48:06,154 INFO L87 Difference]: Start difference. First operand 835 states and 853 transitions. Second operand 45 states. [2018-11-10 08:48:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:06,955 INFO L93 Difference]: Finished difference Result 720 states and 731 transitions. [2018-11-10 08:48:06,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-10 08:48:06,955 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 502 [2018-11-10 08:48:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:06,957 INFO L225 Difference]: With dead ends: 720 [2018-11-10 08:48:06,957 INFO L226 Difference]: Without dead ends: 711 [2018-11-10 08:48:06,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1067 GetRequests, 969 SyntacticMatches, 10 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2820 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1305, Invalid=6705, Unknown=0, NotChecked=0, Total=8010 [2018-11-10 08:48:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-11-10 08:48:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 698. [2018-11-10 08:48:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-11-10 08:48:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 709 transitions. [2018-11-10 08:48:06,964 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 709 transitions. Word has length 502 [2018-11-10 08:48:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:06,965 INFO L481 AbstractCegarLoop]: Abstraction has 698 states and 709 transitions. [2018-11-10 08:48:06,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-10 08:48:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 709 transitions. [2018-11-10 08:48:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-11-10 08:48:06,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:06,968 INFO L375 BasicCegarLoop]: trace histogram [73, 64, 63, 63, 63, 63, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:06,968 INFO L424 AbstractCegarLoop]: === Iteration 34 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:06,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:06,969 INFO L82 PathProgramCache]: Analyzing trace with hash 949805942, now seen corresponding path program 20 times [2018-11-10 08:48:06,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:06,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:06,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:06,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:06,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 13563 backedges. 5944 proven. 843 refuted. 0 times theorem prover too weak. 6776 trivial. 0 not checked. [2018-11-10 08:48:07,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:07,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:07,502 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:07,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:07,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:07,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:07,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:07,513 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:07,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 08:48:07,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:07,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13563 backedges. 5711 proven. 833 refuted. 0 times theorem prover too weak. 7019 trivial. 0 not checked. [2018-11-10 08:48:07,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13563 backedges. 5664 proven. 880 refuted. 0 times theorem prover too weak. 7019 trivial. 0 not checked. [2018-11-10 08:48:08,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:08,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 19] total 59 [2018-11-10 08:48:08,468 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:08,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-10 08:48:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 08:48:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2018-11-10 08:48:08,470 INFO L87 Difference]: Start difference. First operand 698 states and 709 transitions. Second operand 41 states. [2018-11-10 08:48:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:09,163 INFO L93 Difference]: Finished difference Result 793 states and 806 transitions. [2018-11-10 08:48:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 08:48:09,163 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 508 [2018-11-10 08:48:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:09,164 INFO L225 Difference]: With dead ends: 793 [2018-11-10 08:48:09,165 INFO L226 Difference]: Without dead ends: 793 [2018-11-10 08:48:09,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 985 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1979, Invalid=6031, Unknown=0, NotChecked=0, Total=8010 [2018-11-10 08:48:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-10 08:48:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 777. [2018-11-10 08:48:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-11-10 08:48:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 790 transitions. [2018-11-10 08:48:09,171 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 790 transitions. Word has length 508 [2018-11-10 08:48:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:09,172 INFO L481 AbstractCegarLoop]: Abstraction has 777 states and 790 transitions. [2018-11-10 08:48:09,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-10 08:48:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 790 transitions. [2018-11-10 08:48:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-11-10 08:48:09,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:09,175 INFO L375 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:09,175 INFO L424 AbstractCegarLoop]: === Iteration 35 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:09,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1588738369, now seen corresponding path program 21 times [2018-11-10 08:48:09,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:09,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:09,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13962 backedges. 3707 proven. 289 refuted. 0 times theorem prover too weak. 9966 trivial. 0 not checked. [2018-11-10 08:48:09,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:09,522 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:09,522 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:09,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:09,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:09,523 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:09,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:48:09,531 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:48:09,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:48:09,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:09,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13962 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10062 trivial. 0 not checked. [2018-11-10 08:48:09,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13962 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10062 trivial. 0 not checked. [2018-11-10 08:48:10,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:10,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 39 [2018-11-10 08:48:10,066 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:10,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-10 08:48:10,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 08:48:10,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1291, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 08:48:10,067 INFO L87 Difference]: Start difference. First operand 777 states and 790 transitions. Second operand 29 states. [2018-11-10 08:48:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:10,751 INFO L93 Difference]: Finished difference Result 968 states and 987 transitions. [2018-11-10 08:48:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 08:48:10,751 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 514 [2018-11-10 08:48:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:10,753 INFO L225 Difference]: With dead ends: 968 [2018-11-10 08:48:10,753 INFO L226 Difference]: Without dead ends: 968 [2018-11-10 08:48:10,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 1006 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=569, Invalid=2401, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 08:48:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-10 08:48:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 932. [2018-11-10 08:48:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-11-10 08:48:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 950 transitions. [2018-11-10 08:48:10,760 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 950 transitions. Word has length 514 [2018-11-10 08:48:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:10,760 INFO L481 AbstractCegarLoop]: Abstraction has 932 states and 950 transitions. [2018-11-10 08:48:10,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-10 08:48:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 950 transitions. [2018-11-10 08:48:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-11-10 08:48:10,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:10,763 INFO L375 BasicCegarLoop]: trace histogram [85, 75, 74, 74, 74, 74, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:10,764 INFO L424 AbstractCegarLoop]: === Iteration 36 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:10,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:10,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1035131053, now seen corresponding path program 22 times [2018-11-10 08:48:10,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:10,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:10,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:10,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:10,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18553 backedges. 7058 proven. 1492 refuted. 0 times theorem prover too weak. 10003 trivial. 0 not checked. [2018-11-10 08:48:11,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:11,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:11,229 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:11,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:11,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:11,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:11,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:11,237 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:11,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18553 backedges. 10388 proven. 234 refuted. 0 times theorem prover too weak. 7931 trivial. 0 not checked. [2018-11-10 08:48:11,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18553 backedges. 7583 proven. 817 refuted. 0 times theorem prover too weak. 10153 trivial. 0 not checked. [2018-11-10 08:48:12,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:12,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22, 22] total 59 [2018-11-10 08:48:12,288 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:12,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-10 08:48:12,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-10 08:48:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=2882, Unknown=0, NotChecked=0, Total=3422 [2018-11-10 08:48:12,290 INFO L87 Difference]: Start difference. First operand 932 states and 950 transitions. Second operand 49 states. [2018-11-10 08:48:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:13,151 INFO L93 Difference]: Finished difference Result 805 states and 816 transitions. [2018-11-10 08:48:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-10 08:48:13,151 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 587 [2018-11-10 08:48:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:13,153 INFO L225 Difference]: With dead ends: 805 [2018-11-10 08:48:13,153 INFO L226 Difference]: Without dead ends: 796 [2018-11-10 08:48:13,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1243 GetRequests, 1135 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1570, Invalid=8132, Unknown=0, NotChecked=0, Total=9702 [2018-11-10 08:48:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-11-10 08:48:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 783. [2018-11-10 08:48:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-11-10 08:48:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 794 transitions. [2018-11-10 08:48:13,161 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 794 transitions. Word has length 587 [2018-11-10 08:48:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:13,161 INFO L481 AbstractCegarLoop]: Abstraction has 783 states and 794 transitions. [2018-11-10 08:48:13,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-10 08:48:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 794 transitions. [2018-11-10 08:48:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-11-10 08:48:13,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:13,164 INFO L375 BasicCegarLoop]: trace histogram [86, 76, 75, 75, 75, 75, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:13,165 INFO L424 AbstractCegarLoop]: === Iteration 37 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:13,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash -54549948, now seen corresponding path program 23 times [2018-11-10 08:48:13,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:13,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:13,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:13,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:13,166 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 19020 backedges. 7932 proven. 1026 refuted. 0 times theorem prover too weak. 10062 trivial. 0 not checked. [2018-11-10 08:48:13,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:13,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:13,630 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:13,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:13,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:13,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:13,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:13,637 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:13,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-10 08:48:13,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:13,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19020 backedges. 7643 proven. 1015 refuted. 0 times theorem prover too weak. 10362 trivial. 0 not checked. [2018-11-10 08:48:14,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19020 backedges. 7591 proven. 1067 refuted. 0 times theorem prover too weak. 10362 trivial. 0 not checked. [2018-11-10 08:48:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:14,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 20] total 63 [2018-11-10 08:48:14,768 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:14,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-10 08:48:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 08:48:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=738, Invalid=3168, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 08:48:14,769 INFO L87 Difference]: Start difference. First operand 783 states and 794 transitions. Second operand 44 states. [2018-11-10 08:48:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:15,436 INFO L93 Difference]: Finished difference Result 884 states and 897 transitions. [2018-11-10 08:48:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 08:48:15,436 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 593 [2018-11-10 08:48:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:15,438 INFO L225 Difference]: With dead ends: 884 [2018-11-10 08:48:15,438 INFO L226 Difference]: Without dead ends: 884 [2018-11-10 08:48:15,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1249 GetRequests, 1153 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2327, Invalid=6985, Unknown=0, NotChecked=0, Total=9312 [2018-11-10 08:48:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-11-10 08:48:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 868. [2018-11-10 08:48:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-11-10 08:48:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 881 transitions. [2018-11-10 08:48:15,446 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 881 transitions. Word has length 593 [2018-11-10 08:48:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:15,447 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 881 transitions. [2018-11-10 08:48:15,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-10 08:48:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 881 transitions. [2018-11-10 08:48:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-11-10 08:48:15,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:15,451 INFO L375 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:15,451 INFO L424 AbstractCegarLoop]: === Iteration 38 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:15,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1566434701, now seen corresponding path program 24 times [2018-11-10 08:48:15,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:15,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:15,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 19493 backedges. 4787 proven. 356 refuted. 0 times theorem prover too weak. 14350 trivial. 0 not checked. [2018-11-10 08:48:15,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:15,765 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:15,765 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:15,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:15,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:15,765 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:15,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:48:15,772 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:48:15,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:48:15,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:15,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 19493 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14405 trivial. 0 not checked. [2018-11-10 08:48:16,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 19493 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14405 trivial. 0 not checked. [2018-11-10 08:48:16,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:16,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 41 [2018-11-10 08:48:16,401 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:16,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 08:48:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 08:48:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 08:48:16,403 INFO L87 Difference]: Start difference. First operand 868 states and 881 transitions. Second operand 30 states. [2018-11-10 08:48:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:17,114 INFO L93 Difference]: Finished difference Result 1071 states and 1090 transitions. [2018-11-10 08:48:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 08:48:17,114 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 599 [2018-11-10 08:48:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:17,116 INFO L225 Difference]: With dead ends: 1071 [2018-11-10 08:48:17,116 INFO L226 Difference]: Without dead ends: 1071 [2018-11-10 08:48:17,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1174 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=2674, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 08:48:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-11-10 08:48:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1035. [2018-11-10 08:48:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-11-10 08:48:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1053 transitions. [2018-11-10 08:48:17,125 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1053 transitions. Word has length 599 [2018-11-10 08:48:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:17,126 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1053 transitions. [2018-11-10 08:48:17,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 08:48:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1053 transitions. [2018-11-10 08:48:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2018-11-10 08:48:17,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:17,130 INFO L375 BasicCegarLoop]: trace histogram [99, 88, 87, 87, 87, 87, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:17,130 INFO L424 AbstractCegarLoop]: === Iteration 39 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:17,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1301395446, now seen corresponding path program 25 times [2018-11-10 08:48:17,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:17,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:17,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 25402 backedges. 9258 proven. 1805 refuted. 0 times theorem prover too weak. 14339 trivial. 0 not checked. [2018-11-10 08:48:17,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:17,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:17,661 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:17,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:17,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:17,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:17,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:17,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:17,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 25402 backedges. 13686 proven. 290 refuted. 0 times theorem prover too weak. 11426 trivial. 0 not checked. [2018-11-10 08:48:18,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 25402 backedges. 9906 proven. 997 refuted. 0 times theorem prover too weak. 14499 trivial. 0 not checked. [2018-11-10 08:48:18,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:18,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 24, 24] total 64 [2018-11-10 08:48:18,937 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:18,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-10 08:48:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-10 08:48:18,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=3396, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 08:48:18,938 INFO L87 Difference]: Start difference. First operand 1035 states and 1053 transitions. Second operand 53 states. [2018-11-10 08:48:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:19,837 INFO L93 Difference]: Finished difference Result 896 states and 907 transitions. [2018-11-10 08:48:19,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-10 08:48:19,838 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 678 [2018-11-10 08:48:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:19,840 INFO L225 Difference]: With dead ends: 896 [2018-11-10 08:48:19,840 INFO L226 Difference]: Without dead ends: 887 [2018-11-10 08:48:19,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1313 SyntacticMatches, 12 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1860, Invalid=9696, Unknown=0, NotChecked=0, Total=11556 [2018-11-10 08:48:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-11-10 08:48:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 874. [2018-11-10 08:48:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 08:48:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 885 transitions. [2018-11-10 08:48:19,850 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 885 transitions. Word has length 678 [2018-11-10 08:48:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:19,850 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 885 transitions. [2018-11-10 08:48:19,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-10 08:48:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 885 transitions. [2018-11-10 08:48:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2018-11-10 08:48:19,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:19,857 INFO L375 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:19,858 INFO L424 AbstractCegarLoop]: === Iteration 40 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:19,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash 455038029, now seen corresponding path program 26 times [2018-11-10 08:48:19,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:19,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:19,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 25949 backedges. 10317 proven. 1227 refuted. 0 times theorem prover too weak. 14405 trivial. 0 not checked. [2018-11-10 08:48:20,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:20,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:20,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:20,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:20,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:20,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:20,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:20,380 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:20,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-10 08:48:20,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:20,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 25949 backedges. 9966 proven. 1215 refuted. 0 times theorem prover too weak. 14768 trivial. 0 not checked. [2018-11-10 08:48:20,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25949 backedges. 9909 proven. 1272 refuted. 0 times theorem prover too weak. 14768 trivial. 0 not checked. [2018-11-10 08:48:21,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:21,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21, 21] total 67 [2018-11-10 08:48:21,497 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:21,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-10 08:48:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-10 08:48:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=3569, Unknown=0, NotChecked=0, Total=4422 [2018-11-10 08:48:21,498 INFO L87 Difference]: Start difference. First operand 874 states and 885 transitions. Second operand 47 states. [2018-11-10 08:48:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:22,242 INFO L93 Difference]: Finished difference Result 981 states and 994 transitions. [2018-11-10 08:48:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 08:48:22,243 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 684 [2018-11-10 08:48:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:22,245 INFO L225 Difference]: With dead ends: 981 [2018-11-10 08:48:22,245 INFO L226 Difference]: Without dead ends: 981 [2018-11-10 08:48:22,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1436 GetRequests, 1333 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3004 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2704, Invalid=8008, Unknown=0, NotChecked=0, Total=10712 [2018-11-10 08:48:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-11-10 08:48:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 965. [2018-11-10 08:48:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-11-10 08:48:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 978 transitions. [2018-11-10 08:48:22,252 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 978 transitions. Word has length 684 [2018-11-10 08:48:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:22,253 INFO L481 AbstractCegarLoop]: Abstraction has 965 states and 978 transitions. [2018-11-10 08:48:22,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-10 08:48:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 978 transitions. [2018-11-10 08:48:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2018-11-10 08:48:22,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:22,256 INFO L375 BasicCegarLoop]: trace histogram [101, 90, 89, 89, 89, 89, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:22,257 INFO L424 AbstractCegarLoop]: === Iteration 41 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:22,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash 413695830, now seen corresponding path program 27 times [2018-11-10 08:48:22,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:22,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:22,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26502 backedges. 6300 proven. 430 refuted. 0 times theorem prover too weak. 19772 trivial. 0 not checked. [2018-11-10 08:48:22,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:22,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:22,623 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:22,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:22,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:22,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:22,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:48:22,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:48:22,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:48:22,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:22,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26502 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 20009 trivial. 0 not checked. [2018-11-10 08:48:23,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 26502 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 20009 trivial. 0 not checked. [2018-11-10 08:48:23,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:23,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 47 [2018-11-10 08:48:23,418 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:23,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 08:48:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 08:48:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1891, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 08:48:23,418 INFO L87 Difference]: Start difference. First operand 965 states and 978 transitions. Second operand 35 states. [2018-11-10 08:48:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:24,061 INFO L93 Difference]: Finished difference Result 1180 states and 1199 transitions. [2018-11-10 08:48:24,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 08:48:24,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 690 [2018-11-10 08:48:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:24,063 INFO L225 Difference]: With dead ends: 1180 [2018-11-10 08:48:24,063 INFO L226 Difference]: Without dead ends: 1180 [2018-11-10 08:48:24,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1417 GetRequests, 1354 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=762, Invalid=3398, Unknown=0, NotChecked=0, Total=4160 [2018-11-10 08:48:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2018-11-10 08:48:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1144. [2018-11-10 08:48:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-11-10 08:48:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1162 transitions. [2018-11-10 08:48:24,070 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1162 transitions. Word has length 690 [2018-11-10 08:48:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:24,071 INFO L481 AbstractCegarLoop]: Abstraction has 1144 states and 1162 transitions. [2018-11-10 08:48:24,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 08:48:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1162 transitions. [2018-11-10 08:48:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-11-10 08:48:24,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:24,074 INFO L375 BasicCegarLoop]: trace histogram [114, 102, 101, 101, 101, 101, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:24,074 INFO L424 AbstractCegarLoop]: === Iteration 42 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:24,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash -198396188, now seen corresponding path program 28 times [2018-11-10 08:48:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:24,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:24,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 33957 backedges. 11873 proven. 2148 refuted. 0 times theorem prover too weak. 19936 trivial. 0 not checked. [2018-11-10 08:48:24,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:24,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:24,653 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:24,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:24,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:24,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:24,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:24,661 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:24,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 33957 backedges. 17610 proven. 352 refuted. 0 times theorem prover too weak. 15995 trivial. 0 not checked. [2018-11-10 08:48:25,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 33957 backedges. 12657 proven. 1195 refuted. 0 times theorem prover too weak. 20105 trivial. 0 not checked. [2018-11-10 08:48:26,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:26,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 26, 26] total 69 [2018-11-10 08:48:26,015 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:26,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-10 08:48:26,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-10 08:48:26,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=3952, Unknown=0, NotChecked=0, Total=4692 [2018-11-10 08:48:26,016 INFO L87 Difference]: Start difference. First operand 1144 states and 1162 transitions. Second operand 57 states. [2018-11-10 08:48:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:27,095 INFO L93 Difference]: Finished difference Result 993 states and 1004 transitions. [2018-11-10 08:48:27,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-10 08:48:27,096 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 775 [2018-11-10 08:48:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:27,097 INFO L225 Difference]: With dead ends: 993 [2018-11-10 08:48:27,097 INFO L226 Difference]: Without dead ends: 984 [2018-11-10 08:48:27,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1631 GetRequests, 1503 SyntacticMatches, 13 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5025 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2175, Invalid=11397, Unknown=0, NotChecked=0, Total=13572 [2018-11-10 08:48:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-11-10 08:48:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 971. [2018-11-10 08:48:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2018-11-10 08:48:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 982 transitions. [2018-11-10 08:48:27,103 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 982 transitions. Word has length 775 [2018-11-10 08:48:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:27,104 INFO L481 AbstractCegarLoop]: Abstraction has 971 states and 982 transitions. [2018-11-10 08:48:27,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-10 08:48:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 982 transitions. [2018-11-10 08:48:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2018-11-10 08:48:27,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:27,107 INFO L375 BasicCegarLoop]: trace histogram [115, 103, 102, 102, 102, 102, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:27,107 INFO L424 AbstractCegarLoop]: === Iteration 43 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:27,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 57914939, now seen corresponding path program 29 times [2018-11-10 08:48:27,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:27,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:27,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 34590 backedges. 13135 proven. 1446 refuted. 0 times theorem prover too weak. 20009 trivial. 0 not checked. [2018-11-10 08:48:27,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:27,645 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:27,645 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:27,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:27,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:27,646 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:27,653 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:27,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-10 08:48:27,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:27,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 34590 backedges. 7545 proven. 507 refuted. 0 times theorem prover too weak. 26538 trivial. 0 not checked. [2018-11-10 08:48:28,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 34590 backedges. 7545 proven. 507 refuted. 0 times theorem prover too weak. 26538 trivial. 0 not checked. [2018-11-10 08:48:28,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:28,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 16, 16] total 64 [2018-11-10 08:48:28,739 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:28,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-10 08:48:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-10 08:48:28,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=3350, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 08:48:28,740 INFO L87 Difference]: Start difference. First operand 971 states and 982 transitions. Second operand 49 states. [2018-11-10 08:48:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:29,962 INFO L93 Difference]: Finished difference Result 1093 states and 1107 transitions. [2018-11-10 08:48:29,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 08:48:29,962 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 781 [2018-11-10 08:48:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:29,964 INFO L225 Difference]: With dead ends: 1093 [2018-11-10 08:48:29,964 INFO L226 Difference]: Without dead ends: 1093 [2018-11-10 08:48:29,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1636 GetRequests, 1533 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2735, Invalid=8185, Unknown=0, NotChecked=0, Total=10920 [2018-11-10 08:48:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-11-10 08:48:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1074. [2018-11-10 08:48:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2018-11-10 08:48:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1088 transitions. [2018-11-10 08:48:29,971 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1088 transitions. Word has length 781 [2018-11-10 08:48:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:29,972 INFO L481 AbstractCegarLoop]: Abstraction has 1074 states and 1088 transitions. [2018-11-10 08:48:29,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-10 08:48:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1088 transitions. [2018-11-10 08:48:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2018-11-10 08:48:29,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:29,976 INFO L375 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:29,976 INFO L424 AbstractCegarLoop]: === Iteration 44 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:29,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:29,976 INFO L82 PathProgramCache]: Analyzing trace with hash -856695461, now seen corresponding path program 30 times [2018-11-10 08:48:29,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:29,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:29,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 35874 backedges. 8749 proven. 539 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-11-10 08:48:30,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:30,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:30,446 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:30,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:30,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:30,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:30,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:48:30,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:48:30,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:48:30,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:30,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 35874 backedges. 8624 proven. 2005 refuted. 0 times theorem prover too weak. 25245 trivial. 0 not checked. [2018-11-10 08:48:31,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 35874 backedges. 8624 proven. 2005 refuted. 0 times theorem prover too weak. 25245 trivial. 0 not checked. [2018-11-10 08:48:31,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:31,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35, 35] total 55 [2018-11-10 08:48:31,626 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:31,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-10 08:48:31,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-10 08:48:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=2411, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 08:48:31,627 INFO L87 Difference]: Start difference. First operand 1074 states and 1088 transitions. Second operand 52 states. [2018-11-10 08:48:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:32,405 INFO L93 Difference]: Finished difference Result 1285 states and 1303 transitions. [2018-11-10 08:48:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 08:48:32,405 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 793 [2018-11-10 08:48:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:32,407 INFO L225 Difference]: With dead ends: 1285 [2018-11-10 08:48:32,407 INFO L226 Difference]: Without dead ends: 1285 [2018-11-10 08:48:32,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1646 GetRequests, 1533 SyntacticMatches, 31 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1458, Invalid=5514, Unknown=0, NotChecked=0, Total=6972 [2018-11-10 08:48:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-11-10 08:48:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1265. [2018-11-10 08:48:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2018-11-10 08:48:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1283 transitions. [2018-11-10 08:48:32,416 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1283 transitions. Word has length 793 [2018-11-10 08:48:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:32,417 INFO L481 AbstractCegarLoop]: Abstraction has 1265 states and 1283 transitions. [2018-11-10 08:48:32,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-10 08:48:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1283 transitions. [2018-11-10 08:48:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2018-11-10 08:48:32,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:32,422 INFO L375 BasicCegarLoop]: trace histogram [130, 117, 116, 116, 116, 116, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:32,422 INFO L424 AbstractCegarLoop]: === Iteration 45 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:32,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1775023821, now seen corresponding path program 31 times [2018-11-10 08:48:32,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:32,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:32,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 44476 backedges. 14939 proven. 2521 refuted. 0 times theorem prover too weak. 27016 trivial. 0 not checked. [2018-11-10 08:48:33,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:33,039 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:33,039 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:33,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:33,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:33,039 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:33,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:33,050 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:33,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 44476 backedges. 22214 proven. 420 refuted. 0 times theorem prover too weak. 21842 trivial. 0 not checked. [2018-11-10 08:48:33,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 44476 backedges. 15872 proven. 1411 refuted. 0 times theorem prover too weak. 27193 trivial. 0 not checked. [2018-11-10 08:48:34,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:34,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 28, 28] total 74 [2018-11-10 08:48:34,772 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:34,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-10 08:48:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-10 08:48:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=852, Invalid=4550, Unknown=0, NotChecked=0, Total=5402 [2018-11-10 08:48:34,772 INFO L87 Difference]: Start difference. First operand 1265 states and 1283 transitions. Second operand 61 states. [2018-11-10 08:48:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:35,955 INFO L93 Difference]: Finished difference Result 1096 states and 1107 transitions. [2018-11-10 08:48:35,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-10 08:48:35,955 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 878 [2018-11-10 08:48:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:35,958 INFO L225 Difference]: With dead ends: 1096 [2018-11-10 08:48:35,958 INFO L226 Difference]: Without dead ends: 1087 [2018-11-10 08:48:35,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1843 GetRequests, 1705 SyntacticMatches, 14 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5900 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2515, Invalid=13235, Unknown=0, NotChecked=0, Total=15750 [2018-11-10 08:48:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-11-10 08:48:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1074. [2018-11-10 08:48:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2018-11-10 08:48:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1085 transitions. [2018-11-10 08:48:35,965 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1085 transitions. Word has length 878 [2018-11-10 08:48:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:35,966 INFO L481 AbstractCegarLoop]: Abstraction has 1074 states and 1085 transitions. [2018-11-10 08:48:35,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-10 08:48:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1085 transitions. [2018-11-10 08:48:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2018-11-10 08:48:35,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:35,971 INFO L375 BasicCegarLoop]: trace histogram [131, 118, 117, 117, 117, 117, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:35,971 INFO L424 AbstractCegarLoop]: === Iteration 46 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:35,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1315385116, now seen corresponding path program 32 times [2018-11-10 08:48:35,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:35,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45201 backedges. 16422 proven. 1683 refuted. 0 times theorem prover too weak. 27096 trivial. 0 not checked. [2018-11-10 08:48:36,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:36,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:36,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:36,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:36,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:36,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:36,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:36,590 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:36,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-10 08:48:36,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:36,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 45201 backedges. 15929 proven. 1669 refuted. 0 times theorem prover too weak. 27603 trivial. 0 not checked. [2018-11-10 08:48:37,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 45201 backedges. 15862 proven. 1736 refuted. 0 times theorem prover too weak. 27603 trivial. 0 not checked. [2018-11-10 08:48:38,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 23, 23] total 75 [2018-11-10 08:48:38,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:38,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-10 08:48:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-10 08:48:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=4440, Unknown=0, NotChecked=0, Total=5550 [2018-11-10 08:48:38,102 INFO L87 Difference]: Start difference. First operand 1074 states and 1085 transitions. Second operand 53 states. [2018-11-10 08:48:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:39,012 INFO L93 Difference]: Finished difference Result 1193 states and 1206 transitions. [2018-11-10 08:48:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-10 08:48:39,012 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 884 [2018-11-10 08:48:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:39,014 INFO L225 Difference]: With dead ends: 1193 [2018-11-10 08:48:39,014 INFO L226 Difference]: Without dead ends: 1193 [2018-11-10 08:48:39,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1846 GetRequests, 1729 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3918 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3545, Invalid=10261, Unknown=0, NotChecked=0, Total=13806 [2018-11-10 08:48:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-11-10 08:48:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1177. [2018-11-10 08:48:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 08:48:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1190 transitions. [2018-11-10 08:48:39,021 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1190 transitions. Word has length 884 [2018-11-10 08:48:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:39,021 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1190 transitions. [2018-11-10 08:48:39,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-10 08:48:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1190 transitions. [2018-11-10 08:48:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2018-11-10 08:48:39,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:39,025 INFO L375 BasicCegarLoop]: trace histogram [132, 119, 118, 118, 118, 118, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:39,025 INFO L424 AbstractCegarLoop]: === Iteration 47 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:39,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1168968787, now seen corresponding path program 33 times [2018-11-10 08:48:39,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:39,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:39,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 45932 backedges. 9593 proven. 599 refuted. 0 times theorem prover too weak. 35740 trivial. 0 not checked. [2018-11-10 08:48:39,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:39,454 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:39,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:39,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 08:48:39,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:39,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:39,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:48:39,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:48:39,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:48:39,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:39,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 45932 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35906 trivial. 0 not checked. [2018-11-10 08:48:40,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 45932 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35906 trivial. 0 not checked. [2018-11-10 08:48:40,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:40,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 51 [2018-11-10 08:48:40,563 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:40,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-10 08:48:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 08:48:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=2201, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 08:48:40,564 INFO L87 Difference]: Start difference. First operand 1177 states and 1190 transitions. Second operand 37 states. [2018-11-10 08:48:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:41,719 INFO L93 Difference]: Finished difference Result 1416 states and 1435 transitions. [2018-11-10 08:48:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-10 08:48:41,719 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 890 [2018-11-10 08:48:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:41,723 INFO L225 Difference]: With dead ends: 1416 [2018-11-10 08:48:41,723 INFO L226 Difference]: Without dead ends: 1416 [2018-11-10 08:48:41,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1819 GetRequests, 1750 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=911, Invalid=4059, Unknown=0, NotChecked=0, Total=4970 [2018-11-10 08:48:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2018-11-10 08:48:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1380. [2018-11-10 08:48:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2018-11-10 08:48:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1398 transitions. [2018-11-10 08:48:41,736 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1398 transitions. Word has length 890 [2018-11-10 08:48:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:41,737 INFO L481 AbstractCegarLoop]: Abstraction has 1380 states and 1398 transitions. [2018-11-10 08:48:41,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-10 08:48:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1398 transitions. [2018-11-10 08:48:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-11-10 08:48:41,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:41,742 INFO L375 BasicCegarLoop]: trace histogram [147, 133, 132, 132, 132, 132, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:41,743 INFO L424 AbstractCegarLoop]: === Iteration 48 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:41,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash 479285595, now seen corresponding path program 34 times [2018-11-10 08:48:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:41,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:41,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 57235 backedges. 18492 proven. 2924 refuted. 0 times theorem prover too weak. 35819 trivial. 0 not checked. [2018-11-10 08:48:42,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:42,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:42,493 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:42,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:42,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:42,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:42,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:42,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:42,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 57235 backedges. 27552 proven. 494 refuted. 0 times theorem prover too weak. 29189 trivial. 0 not checked. [2018-11-10 08:48:43,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 57235 backedges. 19587 proven. 1645 refuted. 0 times theorem prover too weak. 36003 trivial. 0 not checked. [2018-11-10 08:48:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 30, 30] total 79 [2018-11-10 08:48:44,381 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:44,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-10 08:48:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-10 08:48:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=5190, Unknown=0, NotChecked=0, Total=6162 [2018-11-10 08:48:44,383 INFO L87 Difference]: Start difference. First operand 1380 states and 1398 transitions. Second operand 65 states. [2018-11-10 08:48:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:45,615 INFO L93 Difference]: Finished difference Result 1205 states and 1216 transitions. [2018-11-10 08:48:45,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-10 08:48:45,615 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 987 [2018-11-10 08:48:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:45,618 INFO L225 Difference]: With dead ends: 1205 [2018-11-10 08:48:45,618 INFO L226 Difference]: Without dead ends: 1196 [2018-11-10 08:48:45,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2067 GetRequests, 1919 SyntacticMatches, 15 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6845 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2880, Invalid=15210, Unknown=0, NotChecked=0, Total=18090 [2018-11-10 08:48:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-11-10 08:48:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1183. [2018-11-10 08:48:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-11-10 08:48:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1194 transitions. [2018-11-10 08:48:45,628 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1194 transitions. Word has length 987 [2018-11-10 08:48:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:45,629 INFO L481 AbstractCegarLoop]: Abstraction has 1183 states and 1194 transitions. [2018-11-10 08:48:45,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-10 08:48:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1194 transitions. [2018-11-10 08:48:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2018-11-10 08:48:45,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:45,636 INFO L375 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:45,637 INFO L424 AbstractCegarLoop]: === Iteration 49 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:45,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash 652400242, now seen corresponding path program 35 times [2018-11-10 08:48:45,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:45,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 58058 backedges. 20214 proven. 1938 refuted. 0 times theorem prover too weak. 35906 trivial. 0 not checked. [2018-11-10 08:48:46,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:46,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:46,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:46,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:46,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:46,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:46,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:46,421 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:46,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-10 08:48:46,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:46,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 58058 backedges. 11422 proven. 675 refuted. 0 times theorem prover too weak. 45961 trivial. 0 not checked. [2018-11-10 08:48:47,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 58058 backedges. 11422 proven. 675 refuted. 0 times theorem prover too weak. 45961 trivial. 0 not checked. [2018-11-10 08:48:47,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:47,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 18, 18] total 72 [2018-11-10 08:48:47,811 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:47,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 08:48:47,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 08:48:47,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=4240, Unknown=0, NotChecked=0, Total=5112 [2018-11-10 08:48:47,813 INFO L87 Difference]: Start difference. First operand 1183 states and 1194 transitions. Second operand 55 states. [2018-11-10 08:48:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:49,017 INFO L93 Difference]: Finished difference Result 1317 states and 1331 transitions. [2018-11-10 08:48:49,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-10 08:48:49,017 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 993 [2018-11-10 08:48:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:49,019 INFO L225 Difference]: With dead ends: 1317 [2018-11-10 08:48:49,019 INFO L226 Difference]: Without dead ends: 1317 [2018-11-10 08:48:49,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2070 GetRequests, 1953 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2969 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3537, Invalid=10505, Unknown=0, NotChecked=0, Total=14042 [2018-11-10 08:48:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-11-10 08:48:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1298. [2018-11-10 08:48:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2018-11-10 08:48:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1312 transitions. [2018-11-10 08:48:49,026 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1312 transitions. Word has length 993 [2018-11-10 08:48:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:49,027 INFO L481 AbstractCegarLoop]: Abstraction has 1298 states and 1312 transitions. [2018-11-10 08:48:49,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 08:48:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1312 transitions. [2018-11-10 08:48:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2018-11-10 08:48:49,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:49,031 INFO L375 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:49,031 INFO L424 AbstractCegarLoop]: === Iteration 50 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:49,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:49,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1612257262, now seen corresponding path program 36 times [2018-11-10 08:48:49,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:49,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:49,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 59722 backedges. 12992 proven. 726 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-11-10 08:48:49,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:49,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:49,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:49,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:49,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:49,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:49,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:48:49,690 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:48:49,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:48:49,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:49,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 59722 backedges. 12851 proven. 2632 refuted. 0 times theorem prover too weak. 44239 trivial. 0 not checked. [2018-11-10 08:48:50,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 59722 backedges. 12851 proven. 2632 refuted. 0 times theorem prover too weak. 44239 trivial. 0 not checked. [2018-11-10 08:48:51,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:51,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 39, 39] total 61 [2018-11-10 08:48:51,262 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:51,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-10 08:48:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-10 08:48:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2963, Unknown=0, NotChecked=0, Total=3660 [2018-11-10 08:48:51,263 INFO L87 Difference]: Start difference. First operand 1298 states and 1312 transitions. Second operand 58 states. [2018-11-10 08:48:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:52,255 INFO L93 Difference]: Finished difference Result 1533 states and 1551 transitions. [2018-11-10 08:48:52,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-10 08:48:52,255 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1005 [2018-11-10 08:48:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:52,257 INFO L225 Difference]: With dead ends: 1533 [2018-11-10 08:48:52,257 INFO L226 Difference]: Without dead ends: 1533 [2018-11-10 08:48:52,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2078 GetRequests, 1951 SyntacticMatches, 35 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1846, Invalid=6896, Unknown=0, NotChecked=0, Total=8742 [2018-11-10 08:48:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-11-10 08:48:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1513. [2018-11-10 08:48:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-11-10 08:48:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1531 transitions. [2018-11-10 08:48:52,266 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1531 transitions. Word has length 1005 [2018-11-10 08:48:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:52,266 INFO L481 AbstractCegarLoop]: Abstraction has 1513 states and 1531 transitions. [2018-11-10 08:48:52,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-10 08:48:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1531 transitions. [2018-11-10 08:48:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-11-10 08:48:52,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:52,272 INFO L375 BasicCegarLoop]: trace histogram [165, 150, 149, 149, 149, 149, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:52,272 INFO L424 AbstractCegarLoop]: === Iteration 51 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:52,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1199115932, now seen corresponding path program 37 times [2018-11-10 08:48:52,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:52,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:48:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:52,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 72528 backedges. 22568 proven. 3357 refuted. 0 times theorem prover too weak. 46603 trivial. 0 not checked. [2018-11-10 08:48:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:53,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:53,120 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:53,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:53,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:53,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:53,127 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:48:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:53,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 72528 backedges. 33678 proven. 574 refuted. 0 times theorem prover too weak. 38276 trivial. 0 not checked. [2018-11-10 08:48:54,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 72528 backedges. 23838 proven. 1897 refuted. 0 times theorem prover too weak. 46793 trivial. 0 not checked. [2018-11-10 08:48:55,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:55,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 32, 32] total 84 [2018-11-10 08:48:55,260 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:55,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-10 08:48:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-10 08:48:55,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1100, Invalid=5872, Unknown=0, NotChecked=0, Total=6972 [2018-11-10 08:48:55,261 INFO L87 Difference]: Start difference. First operand 1513 states and 1531 transitions. Second operand 69 states. [2018-11-10 08:48:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:56,780 INFO L93 Difference]: Finished difference Result 1320 states and 1331 transitions. [2018-11-10 08:48:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-10 08:48:56,780 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1102 [2018-11-10 08:48:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:56,783 INFO L225 Difference]: With dead ends: 1320 [2018-11-10 08:48:56,783 INFO L226 Difference]: Without dead ends: 1311 [2018-11-10 08:48:56,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2303 GetRequests, 2145 SyntacticMatches, 16 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7860 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3270, Invalid=17322, Unknown=0, NotChecked=0, Total=20592 [2018-11-10 08:48:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2018-11-10 08:48:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1298. [2018-11-10 08:48:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2018-11-10 08:48:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1309 transitions. [2018-11-10 08:48:56,791 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1309 transitions. Word has length 1102 [2018-11-10 08:48:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:56,792 INFO L481 AbstractCegarLoop]: Abstraction has 1298 states and 1309 transitions. [2018-11-10 08:48:56,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-10 08:48:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1309 transitions. [2018-11-10 08:48:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-11-10 08:48:56,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:56,798 INFO L375 BasicCegarLoop]: trace histogram [166, 151, 150, 150, 150, 150, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:56,798 INFO L424 AbstractCegarLoop]: === Iteration 52 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:48:56,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:56,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1099184443, now seen corresponding path program 38 times [2018-11-10 08:48:56,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:48:56,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:56,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:56,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:56,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:48:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 73455 backedges. 24547 proven. 2211 refuted. 0 times theorem prover too weak. 46697 trivial. 0 not checked. [2018-11-10 08:48:57,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:57,636 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:48:57,636 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:48:57,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:48:57,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:57,637 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:48:57,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:48:57,645 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:48:57,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-10 08:48:57,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:48:57,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 73455 backedges. 13776 proven. 768 refuted. 0 times theorem prover too weak. 58911 trivial. 0 not checked. [2018-11-10 08:48:58,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:48:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 73455 backedges. 13776 proven. 768 refuted. 0 times theorem prover too weak. 58911 trivial. 0 not checked. [2018-11-10 08:48:59,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:48:59,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 19, 19] total 75 [2018-11-10 08:48:59,285 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:48:59,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-10 08:48:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-10 08:48:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2018-11-10 08:48:59,286 INFO L87 Difference]: Start difference. First operand 1298 states and 1309 transitions. Second operand 58 states. [2018-11-10 08:49:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:00,568 INFO L93 Difference]: Finished difference Result 1438 states and 1452 transitions. [2018-11-10 08:49:00,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 08:49:00,569 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1108 [2018-11-10 08:49:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:00,572 INFO L225 Difference]: With dead ends: 1438 [2018-11-10 08:49:00,572 INFO L226 Difference]: Without dead ends: 1438 [2018-11-10 08:49:00,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2305 GetRequests, 2181 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3364 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3891, Invalid=11609, Unknown=0, NotChecked=0, Total=15500 [2018-11-10 08:49:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2018-11-10 08:49:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1419. [2018-11-10 08:49:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-11-10 08:49:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1433 transitions. [2018-11-10 08:49:00,581 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1433 transitions. Word has length 1108 [2018-11-10 08:49:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:00,581 INFO L481 AbstractCegarLoop]: Abstraction has 1419 states and 1433 transitions. [2018-11-10 08:49:00,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-10 08:49:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1433 transitions. [2018-11-10 08:49:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2018-11-10 08:49:00,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:00,587 INFO L375 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:00,587 INFO L424 AbstractCegarLoop]: === Iteration 53 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:00,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash 701388763, now seen corresponding path program 39 times [2018-11-10 08:49:00,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:00,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:00,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:00,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:00,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 75327 backedges. 15547 proven. 830 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-11-10 08:49:01,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:01,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:01,417 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:01,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:01,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:01,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:01,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:49:01,425 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:49:01,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:49:01,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:01,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 75327 backedges. 15398 proven. 2977 refuted. 0 times theorem prover too weak. 56952 trivial. 0 not checked. [2018-11-10 08:49:02,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 75327 backedges. 15398 proven. 2977 refuted. 0 times theorem prover too weak. 56952 trivial. 0 not checked. [2018-11-10 08:49:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:03,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41, 41] total 64 [2018-11-10 08:49:03,165 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:03,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-10 08:49:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-10 08:49:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=3260, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 08:49:03,166 INFO L87 Difference]: Start difference. First operand 1419 states and 1433 transitions. Second operand 61 states. [2018-11-10 08:49:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:04,245 INFO L93 Difference]: Finished difference Result 1666 states and 1684 transitions. [2018-11-10 08:49:04,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 08:49:04,245 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1120 [2018-11-10 08:49:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:04,248 INFO L225 Difference]: With dead ends: 1666 [2018-11-10 08:49:04,248 INFO L226 Difference]: Without dead ends: 1666 [2018-11-10 08:49:04,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2312 GetRequests, 2178 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 08:49:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2018-11-10 08:49:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1646. [2018-11-10 08:49:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2018-11-10 08:49:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1664 transitions. [2018-11-10 08:49:04,261 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1664 transitions. Word has length 1120 [2018-11-10 08:49:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:04,262 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 1664 transitions. [2018-11-10 08:49:04,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-10 08:49:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1664 transitions. [2018-11-10 08:49:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2018-11-10 08:49:04,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:04,269 INFO L375 BasicCegarLoop]: trace histogram [184, 168, 167, 167, 167, 167, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:04,269 INFO L424 AbstractCegarLoop]: === Iteration 54 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:04,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash -411244526, now seen corresponding path program 40 times [2018-11-10 08:49:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:04,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:04,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 90667 backedges. 27203 proven. 3820 refuted. 0 times theorem prover too weak. 59644 trivial. 0 not checked. [2018-11-10 08:49:05,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:05,216 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:05,216 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:05,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:05,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:05,216 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:05,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:05,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:49:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:05,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 90667 backedges. 40646 proven. 660 refuted. 0 times theorem prover too weak. 49361 trivial. 0 not checked. [2018-11-10 08:49:06,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 90667 backedges. 28661 proven. 2167 refuted. 0 times theorem prover too weak. 59839 trivial. 0 not checked. [2018-11-10 08:49:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:07,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 34, 34] total 89 [2018-11-10 08:49:07,701 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:07,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-10 08:49:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-10 08:49:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1236, Invalid=6596, Unknown=0, NotChecked=0, Total=7832 [2018-11-10 08:49:07,702 INFO L87 Difference]: Start difference. First operand 1646 states and 1664 transitions. Second operand 73 states. [2018-11-10 08:49:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:09,084 INFO L93 Difference]: Finished difference Result 1441 states and 1452 transitions. [2018-11-10 08:49:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-11-10 08:49:09,085 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1223 [2018-11-10 08:49:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:09,087 INFO L225 Difference]: With dead ends: 1441 [2018-11-10 08:49:09,088 INFO L226 Difference]: Without dead ends: 1432 [2018-11-10 08:49:09,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2551 GetRequests, 2383 SyntacticMatches, 17 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8945 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3685, Invalid=19571, Unknown=0, NotChecked=0, Total=23256 [2018-11-10 08:49:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2018-11-10 08:49:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1419. [2018-11-10 08:49:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-11-10 08:49:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1430 transitions. [2018-11-10 08:49:09,096 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1430 transitions. Word has length 1223 [2018-11-10 08:49:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:09,097 INFO L481 AbstractCegarLoop]: Abstraction has 1419 states and 1430 transitions. [2018-11-10 08:49:09,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-10 08:49:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1430 transitions. [2018-11-10 08:49:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-11-10 08:49:09,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:09,104 INFO L375 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:09,104 INFO L424 AbstractCegarLoop]: === Iteration 55 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:09,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1790526185, now seen corresponding path program 41 times [2018-11-10 08:49:09,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:09,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:09,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 91704 backedges. 29457 proven. 2502 refuted. 0 times theorem prover too weak. 59745 trivial. 0 not checked. [2018-11-10 08:49:10,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:10,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:10,101 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:10,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:10,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:10,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:10,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:49:10,109 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:49:10,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-10 08:49:10,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:10,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 91704 backedges. 28706 proven. 2485 refuted. 0 times theorem prover too weak. 60513 trivial. 0 not checked. [2018-11-10 08:49:11,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 91704 backedges. 28624 proven. 2567 refuted. 0 times theorem prover too weak. 60513 trivial. 0 not checked. [2018-11-10 08:49:12,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:12,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 26, 26] total 87 [2018-11-10 08:49:12,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:12,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-10 08:49:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-10 08:49:12,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=5921, Unknown=0, NotChecked=0, Total=7482 [2018-11-10 08:49:12,299 INFO L87 Difference]: Start difference. First operand 1419 states and 1430 transitions. Second operand 62 states. [2018-11-10 08:49:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:13,412 INFO L93 Difference]: Finished difference Result 1556 states and 1569 transitions. [2018-11-10 08:49:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-10 08:49:13,412 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1229 [2018-11-10 08:49:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:13,414 INFO L225 Difference]: With dead ends: 1556 [2018-11-10 08:49:13,414 INFO L226 Difference]: Without dead ends: 1556 [2018-11-10 08:49:13,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2551 GetRequests, 2413 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5529 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5021, Invalid=14161, Unknown=0, NotChecked=0, Total=19182 [2018-11-10 08:49:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-11-10 08:49:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1540. [2018-11-10 08:49:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-11-10 08:49:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1553 transitions. [2018-11-10 08:49:13,424 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1553 transitions. Word has length 1229 [2018-11-10 08:49:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:13,425 INFO L481 AbstractCegarLoop]: Abstraction has 1540 states and 1553 transitions. [2018-11-10 08:49:13,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-10 08:49:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1553 transitions. [2018-11-10 08:49:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1236 [2018-11-10 08:49:13,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:13,434 INFO L375 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:13,434 INFO L424 AbstractCegarLoop]: === Iteration 56 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:13,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:13,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1422886258, now seen corresponding path program 42 times [2018-11-10 08:49:13,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:13,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:13,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 92747 backedges. 16634 proven. 905 refuted. 0 times theorem prover too weak. 75208 trivial. 0 not checked. [2018-11-10 08:49:14,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:14,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:14,127 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:14,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:14,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:14,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:14,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:49:14,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:49:14,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:49:14,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:14,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 92747 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75344 trivial. 0 not checked. [2018-11-10 08:49:15,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 92747 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75344 trivial. 0 not checked. [2018-11-10 08:49:15,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:15,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 59 [2018-11-10 08:49:15,738 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:15,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 08:49:15,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 08:49:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=2934, Unknown=0, NotChecked=0, Total=3540 [2018-11-10 08:49:15,739 INFO L87 Difference]: Start difference. First operand 1540 states and 1553 transitions. Second operand 42 states. [2018-11-10 08:49:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:16,965 INFO L93 Difference]: Finished difference Result 1815 states and 1834 transitions. [2018-11-10 08:49:16,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-10 08:49:16,965 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1235 [2018-11-10 08:49:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:16,967 INFO L225 Difference]: With dead ends: 1815 [2018-11-10 08:49:16,968 INFO L226 Difference]: Without dead ends: 1815 [2018-11-10 08:49:16,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2514 GetRequests, 2434 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=5466, Unknown=0, NotChecked=0, Total=6642 [2018-11-10 08:49:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2018-11-10 08:49:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1779. [2018-11-10 08:49:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2018-11-10 08:49:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 1797 transitions. [2018-11-10 08:49:16,978 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 1797 transitions. Word has length 1235 [2018-11-10 08:49:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:16,979 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 1797 transitions. [2018-11-10 08:49:16,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 08:49:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 1797 transitions. [2018-11-10 08:49:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1351 [2018-11-10 08:49:16,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:16,988 INFO L375 BasicCegarLoop]: trace histogram [204, 187, 186, 186, 186, 186, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:16,989 INFO L424 AbstractCegarLoop]: === Iteration 57 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:16,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1899857851, now seen corresponding path program 43 times [2018-11-10 08:49:16,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:16,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:16,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:16,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 111982 backedges. 32433 proven. 4313 refuted. 0 times theorem prover too weak. 75236 trivial. 0 not checked. [2018-11-10 08:49:18,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:18,096 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:18,096 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:18,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:18,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:18,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:18,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:18,103 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:49:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:18,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 111982 backedges. 48510 proven. 752 refuted. 0 times theorem prover too weak. 62720 trivial. 0 not checked. [2018-11-10 08:49:19,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 111982 backedges. 34092 proven. 2455 refuted. 0 times theorem prover too weak. 75435 trivial. 0 not checked. [2018-11-10 08:49:20,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:20,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 36, 36] total 94 [2018-11-10 08:49:20,902 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:20,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-10 08:49:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-10 08:49:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=7362, Unknown=0, NotChecked=0, Total=8742 [2018-11-10 08:49:20,903 INFO L87 Difference]: Start difference. First operand 1779 states and 1797 transitions. Second operand 77 states. [2018-11-10 08:49:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:22,387 INFO L93 Difference]: Finished difference Result 1568 states and 1579 transitions. [2018-11-10 08:49:22,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-10 08:49:22,388 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 1350 [2018-11-10 08:49:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:22,390 INFO L225 Difference]: With dead ends: 1568 [2018-11-10 08:49:22,390 INFO L226 Difference]: Without dead ends: 1559 [2018-11-10 08:49:22,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2811 GetRequests, 2633 SyntacticMatches, 18 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4125, Invalid=21957, Unknown=0, NotChecked=0, Total=26082 [2018-11-10 08:49:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2018-11-10 08:49:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1546. [2018-11-10 08:49:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 08:49:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1557 transitions. [2018-11-10 08:49:22,404 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1557 transitions. Word has length 1350 [2018-11-10 08:49:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:22,404 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 1557 transitions. [2018-11-10 08:49:22,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-10 08:49:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1557 transitions. [2018-11-10 08:49:22,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1357 [2018-11-10 08:49:22,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:22,417 INFO L375 BasicCegarLoop]: trace histogram [205, 188, 187, 187, 187, 187, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:22,417 INFO L424 AbstractCegarLoop]: === Iteration 58 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:22,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash 826715474, now seen corresponding path program 44 times [2018-11-10 08:49:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:22,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:22,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:22,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:22,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 113135 backedges. 34980 proven. 2811 refuted. 0 times theorem prover too weak. 75344 trivial. 0 not checked. [2018-11-10 08:49:23,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:23,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:23,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:23,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:23,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:23,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:23,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:49:23,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:49:23,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-10 08:49:23,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:23,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 113135 backedges. 19405 proven. 972 refuted. 0 times theorem prover too weak. 92758 trivial. 0 not checked. [2018-11-10 08:49:24,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 113135 backedges. 19405 proven. 972 refuted. 0 times theorem prover too weak. 92758 trivial. 0 not checked. [2018-11-10 08:49:25,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:25,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21, 21] total 79 [2018-11-10 08:49:25,522 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:25,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-10 08:49:25,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-10 08:49:25,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=5150, Unknown=0, NotChecked=0, Total=6162 [2018-11-10 08:49:25,523 INFO L87 Difference]: Start difference. First operand 1546 states and 1557 transitions. Second operand 64 states. [2018-11-10 08:49:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:26,999 INFO L93 Difference]: Finished difference Result 1698 states and 1712 transitions. [2018-11-10 08:49:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-10 08:49:26,999 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1356 [2018-11-10 08:49:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:27,002 INFO L225 Difference]: With dead ends: 1698 [2018-11-10 08:49:27,002 INFO L226 Difference]: Without dead ends: 1698 [2018-11-10 08:49:27,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2811 GetRequests, 2673 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4465, Invalid=13625, Unknown=0, NotChecked=0, Total=18090 [2018-11-10 08:49:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2018-11-10 08:49:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1679. [2018-11-10 08:49:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2018-11-10 08:49:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 1693 transitions. [2018-11-10 08:49:27,012 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 1693 transitions. Word has length 1356 [2018-11-10 08:49:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:27,012 INFO L481 AbstractCegarLoop]: Abstraction has 1679 states and 1693 transitions. [2018-11-10 08:49:27,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-10 08:49:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1693 transitions. [2018-11-10 08:49:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1369 [2018-11-10 08:49:27,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:27,022 INFO L375 BasicCegarLoop]: trace histogram [207, 190, 189, 189, 189, 189, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:27,022 INFO L424 AbstractCegarLoop]: === Iteration 59 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:27,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1424139890, now seen corresponding path program 45 times [2018-11-10 08:49:27,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:27,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:27,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 115459 backedges. 21614 proven. 1059 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-11-10 08:49:28,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:28,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:28,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:28,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:28,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:28,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:28,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:49:28,059 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:49:28,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:49:28,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:28,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 115459 backedges. 21449 proven. 3730 refuted. 0 times theorem prover too weak. 90280 trivial. 0 not checked. [2018-11-10 08:49:29,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 115459 backedges. 21449 proven. 3730 refuted. 0 times theorem prover too weak. 90280 trivial. 0 not checked. [2018-11-10 08:49:30,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:30,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 45, 45] total 70 [2018-11-10 08:49:30,303 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:30,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-10 08:49:30,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-10 08:49:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=3896, Unknown=0, NotChecked=0, Total=4830 [2018-11-10 08:49:30,304 INFO L87 Difference]: Start difference. First operand 1679 states and 1693 transitions. Second operand 67 states. [2018-11-10 08:49:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:31,440 INFO L93 Difference]: Finished difference Result 1950 states and 1968 transitions. [2018-11-10 08:49:31,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-10 08:49:31,440 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1368 [2018-11-10 08:49:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:31,443 INFO L225 Difference]: With dead ends: 1950 [2018-11-10 08:49:31,443 INFO L226 Difference]: Without dead ends: 1950 [2018-11-10 08:49:31,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2816 GetRequests, 2668 SyntacticMatches, 41 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2518, Invalid=9254, Unknown=0, NotChecked=0, Total=11772 [2018-11-10 08:49:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2018-11-10 08:49:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1930. [2018-11-10 08:49:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2018-11-10 08:49:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 1948 transitions. [2018-11-10 08:49:31,458 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 1948 transitions. Word has length 1368 [2018-11-10 08:49:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:31,458 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 1948 transitions. [2018-11-10 08:49:31,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-10 08:49:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 1948 transitions. [2018-11-10 08:49:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1484 [2018-11-10 08:49:31,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:31,473 INFO L375 BasicCegarLoop]: trace histogram [225, 207, 206, 206, 206, 206, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:31,474 INFO L424 AbstractCegarLoop]: === Iteration 60 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:31,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 943291145, now seen corresponding path program 46 times [2018-11-10 08:49:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:31,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:31,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 136821 backedges. 38294 proven. 4836 refuted. 0 times theorem prover too weak. 93691 trivial. 0 not checked. [2018-11-10 08:49:32,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:32,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:32,741 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:32,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:32,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:32,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:32,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:32,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:49:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:33,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 136821 backedges. 57324 proven. 850 refuted. 0 times theorem prover too weak. 78647 trivial. 0 not checked. [2018-11-10 08:49:34,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 136821 backedges. 40167 proven. 2761 refuted. 0 times theorem prover too weak. 93893 trivial. 0 not checked. [2018-11-10 08:49:35,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:35,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 38, 38] total 99 [2018-11-10 08:49:35,912 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:35,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-10 08:49:35,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-10 08:49:35,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1532, Invalid=8170, Unknown=0, NotChecked=0, Total=9702 [2018-11-10 08:49:35,914 INFO L87 Difference]: Start difference. First operand 1930 states and 1948 transitions. Second operand 81 states. [2018-11-10 08:49:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:37,574 INFO L93 Difference]: Finished difference Result 1701 states and 1712 transitions. [2018-11-10 08:49:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-10 08:49:37,574 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1483 [2018-11-10 08:49:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:37,576 INFO L225 Difference]: With dead ends: 1701 [2018-11-10 08:49:37,576 INFO L226 Difference]: Without dead ends: 1692 [2018-11-10 08:49:37,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3083 GetRequests, 2895 SyntacticMatches, 19 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11325 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4590, Invalid=24480, Unknown=0, NotChecked=0, Total=29070 [2018-11-10 08:49:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2018-11-10 08:49:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1679. [2018-11-10 08:49:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2018-11-10 08:49:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 1690 transitions. [2018-11-10 08:49:37,585 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 1690 transitions. Word has length 1483 [2018-11-10 08:49:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:37,586 INFO L481 AbstractCegarLoop]: Abstraction has 1679 states and 1690 transitions. [2018-11-10 08:49:37,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-10 08:49:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1690 transitions. [2018-11-10 08:49:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1490 [2018-11-10 08:49:37,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:37,595 INFO L375 BasicCegarLoop]: trace histogram [226, 208, 207, 207, 207, 207, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:37,595 INFO L424 AbstractCegarLoop]: === Iteration 61 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:37,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash -603915360, now seen corresponding path program 47 times [2018-11-10 08:49:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:37,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:37,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 138096 backedges. 41152 proven. 3138 refuted. 0 times theorem prover too weak. 93806 trivial. 0 not checked. [2018-11-10 08:49:38,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:38,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:38,885 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:38,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:38,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:38,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:38,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:49:38,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:49:39,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-10 08:49:39,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:39,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 138096 backedges. 22716 proven. 1083 refuted. 0 times theorem prover too weak. 114297 trivial. 0 not checked. [2018-11-10 08:49:40,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 138096 backedges. 22716 proven. 1083 refuted. 0 times theorem prover too weak. 114297 trivial. 0 not checked. [2018-11-10 08:49:41,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:41,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 22, 22] total 81 [2018-11-10 08:49:41,141 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:41,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-10 08:49:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-10 08:49:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=5429, Unknown=0, NotChecked=0, Total=6480 [2018-11-10 08:49:41,143 INFO L87 Difference]: Start difference. First operand 1679 states and 1690 transitions. Second operand 67 states. [2018-11-10 08:49:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:42,808 INFO L93 Difference]: Finished difference Result 1837 states and 1851 transitions. [2018-11-10 08:49:42,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-10 08:49:42,808 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1489 [2018-11-10 08:49:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:42,810 INFO L225 Difference]: With dead ends: 1837 [2018-11-10 08:49:42,810 INFO L226 Difference]: Without dead ends: 1837 [2018-11-10 08:49:42,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3082 GetRequests, 2937 SyntacticMatches, 7 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4767, Invalid=14693, Unknown=0, NotChecked=0, Total=19460 [2018-11-10 08:49:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2018-11-10 08:49:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1818. [2018-11-10 08:49:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1818 states. [2018-11-10 08:49:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 1832 transitions. [2018-11-10 08:49:42,820 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 1832 transitions. Word has length 1489 [2018-11-10 08:49:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:42,821 INFO L481 AbstractCegarLoop]: Abstraction has 1818 states and 1832 transitions. [2018-11-10 08:49:42,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-10 08:49:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 1832 transitions. [2018-11-10 08:49:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1502 [2018-11-10 08:49:42,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:42,830 INFO L375 BasicCegarLoop]: trace histogram [228, 210, 209, 209, 209, 209, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:42,830 INFO L424 AbstractCegarLoop]: === Iteration 62 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:42,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash 394609216, now seen corresponding path program 48 times [2018-11-10 08:49:42,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:42,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:42,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:42,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 140664 backedges. 25162 proven. 1184 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-11-10 08:49:44,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:44,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:44,027 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:44,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:44,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:44,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:49:44,036 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:49:44,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:49:44,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:44,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 140664 backedges. 24989 proven. 4138 refuted. 0 times theorem prover too weak. 111537 trivial. 0 not checked. [2018-11-10 08:49:45,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 140664 backedges. 24989 proven. 4138 refuted. 0 times theorem prover too weak. 111537 trivial. 0 not checked. [2018-11-10 08:49:46,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:46,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 47, 47] total 73 [2018-11-10 08:49:46,594 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:46,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-10 08:49:46,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-10 08:49:46,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=4235, Unknown=0, NotChecked=0, Total=5256 [2018-11-10 08:49:46,595 INFO L87 Difference]: Start difference. First operand 1818 states and 1832 transitions. Second operand 70 states. [2018-11-10 08:49:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:47,977 INFO L93 Difference]: Finished difference Result 2101 states and 2119 transitions. [2018-11-10 08:49:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-10 08:49:47,977 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 1501 [2018-11-10 08:49:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:47,981 INFO L225 Difference]: With dead ends: 2101 [2018-11-10 08:49:47,981 INFO L226 Difference]: Without dead ends: 2101 [2018-11-10 08:49:47,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3086 GetRequests, 2931 SyntacticMatches, 43 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2766, Invalid=10116, Unknown=0, NotChecked=0, Total=12882 [2018-11-10 08:49:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2018-11-10 08:49:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2081. [2018-11-10 08:49:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-11-10 08:49:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2099 transitions. [2018-11-10 08:49:47,993 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2099 transitions. Word has length 1501 [2018-11-10 08:49:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:47,994 INFO L481 AbstractCegarLoop]: Abstraction has 2081 states and 2099 transitions. [2018-11-10 08:49:47,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-10 08:49:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2099 transitions. [2018-11-10 08:49:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2018-11-10 08:49:48,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:48,006 INFO L375 BasicCegarLoop]: trace histogram [247, 228, 227, 227, 227, 227, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:48,007 INFO L424 AbstractCegarLoop]: === Iteration 63 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:48,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1040701906, now seen corresponding path program 49 times [2018-11-10 08:49:48,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:48,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:49:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:48,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 165550 backedges. 44822 proven. 5389 refuted. 0 times theorem prover too weak. 115339 trivial. 0 not checked. [2018-11-10 08:49:49,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:49,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:49,483 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:49,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:49,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:49,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:49,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:49,495 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:49:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:49,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 165550 backedges. 67142 proven. 954 refuted. 0 times theorem prover too weak. 97454 trivial. 0 not checked. [2018-11-10 08:49:51,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 165550 backedges. 46922 proven. 3085 refuted. 0 times theorem prover too weak. 115543 trivial. 0 not checked. [2018-11-10 08:49:53,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:53,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 40, 40] total 104 [2018-11-10 08:49:53,029 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:53,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-10 08:49:53,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-10 08:49:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1692, Invalid=9020, Unknown=0, NotChecked=0, Total=10712 [2018-11-10 08:49:53,031 INFO L87 Difference]: Start difference. First operand 2081 states and 2099 transitions. Second operand 85 states. [2018-11-10 08:49:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:55,340 INFO L93 Difference]: Finished difference Result 1840 states and 1851 transitions. [2018-11-10 08:49:55,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-11-10 08:49:55,340 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1622 [2018-11-10 08:49:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:55,344 INFO L225 Difference]: With dead ends: 1840 [2018-11-10 08:49:55,344 INFO L226 Difference]: Without dead ends: 1831 [2018-11-10 08:49:55,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3367 GetRequests, 3169 SyntacticMatches, 20 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12620 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5080, Invalid=27140, Unknown=0, NotChecked=0, Total=32220 [2018-11-10 08:49:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2018-11-10 08:49:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1818. [2018-11-10 08:49:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1818 states. [2018-11-10 08:49:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 1829 transitions. [2018-11-10 08:49:55,357 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 1829 transitions. Word has length 1622 [2018-11-10 08:49:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:55,358 INFO L481 AbstractCegarLoop]: Abstraction has 1818 states and 1829 transitions. [2018-11-10 08:49:55,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-10 08:49:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 1829 transitions. [2018-11-10 08:49:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1629 [2018-11-10 08:49:55,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:55,370 INFO L375 BasicCegarLoop]: trace histogram [248, 229, 228, 228, 228, 228, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:49:55,370 INFO L424 AbstractCegarLoop]: === Iteration 64 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:49:55,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash 758091049, now seen corresponding path program 50 times [2018-11-10 08:49:55,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:49:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:55,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:55,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:49:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 166953 backedges. 48009 proven. 3483 refuted. 0 times theorem prover too weak. 115461 trivial. 0 not checked. [2018-11-10 08:49:56,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:56,958 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:49:56,958 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:49:56,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:49:56,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:56,959 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:49:56,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:49:56,969 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:49:57,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-10 08:49:57,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:49:57,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:49:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 166953 backedges. 26382 proven. 1200 refuted. 0 times theorem prover too weak. 139371 trivial. 0 not checked. [2018-11-10 08:49:58,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:49:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 166953 backedges. 26382 proven. 1200 refuted. 0 times theorem prover too weak. 139371 trivial. 0 not checked. [2018-11-10 08:49:59,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:49:59,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 23, 23] total 83 [2018-11-10 08:49:59,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:49:59,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-10 08:49:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-10 08:49:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=5714, Unknown=0, NotChecked=0, Total=6806 [2018-11-10 08:49:59,515 INFO L87 Difference]: Start difference. First operand 1818 states and 1829 transitions. Second operand 70 states. [2018-11-10 08:50:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:01,291 INFO L93 Difference]: Finished difference Result 1982 states and 1996 transitions. [2018-11-10 08:50:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-10 08:50:01,292 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 1628 [2018-11-10 08:50:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:01,295 INFO L225 Difference]: With dead ends: 1982 [2018-11-10 08:50:01,295 INFO L226 Difference]: Without dead ends: 1982 [2018-11-10 08:50:01,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3365 GetRequests, 3213 SyntacticMatches, 9 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5218 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5079, Invalid=15801, Unknown=0, NotChecked=0, Total=20880 [2018-11-10 08:50:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2018-11-10 08:50:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1963. [2018-11-10 08:50:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2018-11-10 08:50:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 1977 transitions. [2018-11-10 08:50:01,307 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 1977 transitions. Word has length 1628 [2018-11-10 08:50:01,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:01,308 INFO L481 AbstractCegarLoop]: Abstraction has 1963 states and 1977 transitions. [2018-11-10 08:50:01,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-10 08:50:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 1977 transitions. [2018-11-10 08:50:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1641 [2018-11-10 08:50:01,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:01,320 INFO L375 BasicCegarLoop]: trace histogram [250, 231, 230, 230, 230, 230, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:01,320 INFO L424 AbstractCegarLoop]: === Iteration 65 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:01,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash -489013047, now seen corresponding path program 51 times [2018-11-10 08:50:01,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:01,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:50:01,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:01,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 169777 backedges. 29077 proven. 1316 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-11-10 08:50:02,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:02,708 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:02,708 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:02,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:02,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:02,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:02,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:50:02,719 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:50:02,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:50:02,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:50:02,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 169777 backedges. 28896 proven. 4567 refuted. 0 times theorem prover too weak. 136314 trivial. 0 not checked. [2018-11-10 08:50:04,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 169777 backedges. 28896 proven. 4567 refuted. 0 times theorem prover too weak. 136314 trivial. 0 not checked. [2018-11-10 08:50:05,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:05,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 49, 49] total 76 [2018-11-10 08:50:05,610 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:05,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-10 08:50:05,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-10 08:50:05,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=4588, Unknown=0, NotChecked=0, Total=5700 [2018-11-10 08:50:05,611 INFO L87 Difference]: Start difference. First operand 1963 states and 1977 transitions. Second operand 73 states. [2018-11-10 08:50:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:06,893 INFO L93 Difference]: Finished difference Result 2258 states and 2276 transitions. [2018-11-10 08:50:06,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-10 08:50:06,893 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1640 [2018-11-10 08:50:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:06,896 INFO L225 Difference]: With dead ends: 2258 [2018-11-10 08:50:06,896 INFO L226 Difference]: Without dead ends: 2258 [2018-11-10 08:50:06,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3368 GetRequests, 3206 SyntacticMatches, 45 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4605 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3026, Invalid=11016, Unknown=0, NotChecked=0, Total=14042 [2018-11-10 08:50:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2018-11-10 08:50:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2238. [2018-11-10 08:50:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2018-11-10 08:50:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 2256 transitions. [2018-11-10 08:50:06,907 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 2256 transitions. Word has length 1640 [2018-11-10 08:50:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:06,907 INFO L481 AbstractCegarLoop]: Abstraction has 2238 states and 2256 transitions. [2018-11-10 08:50:06,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-10 08:50:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 2256 transitions. [2018-11-10 08:50:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1768 [2018-11-10 08:50:06,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:06,919 INFO L375 BasicCegarLoop]: trace histogram [270, 250, 249, 249, 249, 249, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:06,919 INFO L424 AbstractCegarLoop]: === Iteration 66 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:06,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1319029312, now seen corresponding path program 52 times [2018-11-10 08:50:06,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:06,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:06,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:50:06,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:06,920 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 198553 backedges. 52053 proven. 5972 refuted. 0 times theorem prover too weak. 140528 trivial. 0 not checked. [2018-11-10 08:50:08,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:08,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:08,583 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:08,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:08,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:08,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:08,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:50:08,594 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:50:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:08,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 198553 backedges. 78018 proven. 1064 refuted. 0 times theorem prover too weak. 119471 trivial. 0 not checked. [2018-11-10 08:50:10,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 198553 backedges. 54393 proven. 3427 refuted. 0 times theorem prover too weak. 140733 trivial. 0 not checked. [2018-11-10 08:50:12,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:12,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 42, 42] total 109 [2018-11-10 08:50:12,617 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:12,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-11-10 08:50:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-11-10 08:50:12,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9912, Unknown=0, NotChecked=0, Total=11772 [2018-11-10 08:50:12,618 INFO L87 Difference]: Start difference. First operand 2238 states and 2256 transitions. Second operand 89 states. [2018-11-10 08:50:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:14,601 INFO L93 Difference]: Finished difference Result 1985 states and 1996 transitions. [2018-11-10 08:50:14,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-11-10 08:50:14,601 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1767 [2018-11-10 08:50:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:14,604 INFO L225 Difference]: With dead ends: 1985 [2018-11-10 08:50:14,604 INFO L226 Difference]: Without dead ends: 1976 [2018-11-10 08:50:14,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3663 GetRequests, 3455 SyntacticMatches, 21 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13985 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5595, Invalid=29937, Unknown=0, NotChecked=0, Total=35532 [2018-11-10 08:50:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2018-11-10 08:50:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1963. [2018-11-10 08:50:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2018-11-10 08:50:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 1974 transitions. [2018-11-10 08:50:14,614 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 1974 transitions. Word has length 1767 [2018-11-10 08:50:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:14,615 INFO L481 AbstractCegarLoop]: Abstraction has 1963 states and 1974 transitions. [2018-11-10 08:50:14,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-11-10 08:50:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 1974 transitions. [2018-11-10 08:50:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1774 [2018-11-10 08:50:14,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:14,627 INFO L375 BasicCegarLoop]: trace histogram [271, 251, 250, 250, 250, 250, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:14,627 INFO L424 AbstractCegarLoop]: === Iteration 67 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:14,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1392623767, now seen corresponding path program 53 times [2018-11-10 08:50:14,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:14,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:14,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:50:14,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:14,628 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 200090 backedges. 55587 proven. 3846 refuted. 0 times theorem prover too weak. 140657 trivial. 0 not checked. [2018-11-10 08:50:16,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:16,335 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:16,335 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:16,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:16,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:16,335 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:16,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:50:16,347 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:50:16,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-10 08:50:16,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:50:16,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 200090 backedges. 30421 proven. 1323 refuted. 0 times theorem prover too weak. 168346 trivial. 0 not checked. [2018-11-10 08:50:17,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 200090 backedges. 30421 proven. 1323 refuted. 0 times theorem prover too weak. 168346 trivial. 0 not checked. [2018-11-10 08:50:19,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:19,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 24, 24] total 85 [2018-11-10 08:50:19,275 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:19,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-10 08:50:19,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-10 08:50:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=6005, Unknown=0, NotChecked=0, Total=7140 [2018-11-10 08:50:19,276 INFO L87 Difference]: Start difference. First operand 1963 states and 1974 transitions. Second operand 73 states. [2018-11-10 08:50:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:21,124 INFO L93 Difference]: Finished difference Result 2133 states and 2147 transitions. [2018-11-10 08:50:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-10 08:50:21,125 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1773 [2018-11-10 08:50:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:21,128 INFO L225 Difference]: With dead ends: 2133 [2018-11-10 08:50:21,128 INFO L226 Difference]: Without dead ends: 2133 [2018-11-10 08:50:21,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3660 GetRequests, 3501 SyntacticMatches, 11 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5739 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5401, Invalid=16949, Unknown=0, NotChecked=0, Total=22350 [2018-11-10 08:50:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2018-11-10 08:50:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2114. [2018-11-10 08:50:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2018-11-10 08:50:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2128 transitions. [2018-11-10 08:50:21,141 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2128 transitions. Word has length 1773 [2018-11-10 08:50:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:21,142 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 2128 transitions. [2018-11-10 08:50:21,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-10 08:50:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2128 transitions. [2018-11-10 08:50:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1786 [2018-11-10 08:50:21,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:21,156 INFO L375 BasicCegarLoop]: trace histogram [273, 253, 252, 252, 252, 252, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:21,156 INFO L424 AbstractCegarLoop]: === Iteration 68 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash -77704777, now seen corresponding path program 54 times [2018-11-10 08:50:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:21,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:50:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:21,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 203182 backedges. 33377 proven. 1455 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-11-10 08:50:22,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:22,752 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:22,752 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:22,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:22,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:22,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:22,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:50:22,762 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:50:23,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:50:23,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:50:23,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 203182 backedges. 33188 proven. 5017 refuted. 0 times theorem prover too weak. 164977 trivial. 0 not checked. [2018-11-10 08:50:24,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 203182 backedges. 33188 proven. 5017 refuted. 0 times theorem prover too weak. 164977 trivial. 0 not checked. [2018-11-10 08:50:26,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:26,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 51, 51] total 79 [2018-11-10 08:50:26,017 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:26,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-11-10 08:50:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-11-10 08:50:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1207, Invalid=4955, Unknown=0, NotChecked=0, Total=6162 [2018-11-10 08:50:26,018 INFO L87 Difference]: Start difference. First operand 2114 states and 2128 transitions. Second operand 76 states. [2018-11-10 08:50:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:27,442 INFO L93 Difference]: Finished difference Result 2421 states and 2439 transitions. [2018-11-10 08:50:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-10 08:50:27,442 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1785 [2018-11-10 08:50:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:27,446 INFO L225 Difference]: With dead ends: 2421 [2018-11-10 08:50:27,446 INFO L226 Difference]: Without dead ends: 2421 [2018-11-10 08:50:27,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3662 GetRequests, 3493 SyntacticMatches, 47 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5001 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3298, Invalid=11954, Unknown=0, NotChecked=0, Total=15252 [2018-11-10 08:50:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2018-11-10 08:50:27,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2401. [2018-11-10 08:50:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-11-10 08:50:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2419 transitions. [2018-11-10 08:50:27,460 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2419 transitions. Word has length 1785 [2018-11-10 08:50:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:27,462 INFO L481 AbstractCegarLoop]: Abstraction has 2401 states and 2419 transitions. [2018-11-10 08:50:27,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-11-10 08:50:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2419 transitions. [2018-11-10 08:50:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-11-10 08:50:27,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:27,477 INFO L375 BasicCegarLoop]: trace histogram [294, 273, 272, 272, 272, 272, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:27,477 INFO L424 AbstractCegarLoop]: === Iteration 69 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:27,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1697151063, now seen corresponding path program 55 times [2018-11-10 08:50:27,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:27,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:50:27,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:27,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 236232 backedges. 60023 proven. 6585 refuted. 0 times theorem prover too weak. 169624 trivial. 0 not checked. [2018-11-10 08:50:29,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:29,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:29,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:29,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:29,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:29,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:29,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:50:29,390 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:50:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:29,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 236232 backedges. 90006 proven. 1180 refuted. 0 times theorem prover too weak. 145046 trivial. 0 not checked. [2018-11-10 08:50:31,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 236232 backedges. 62616 proven. 3787 refuted. 0 times theorem prover too weak. 169829 trivial. 0 not checked. [2018-11-10 08:50:33,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:33,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 44, 44] total 114 [2018-11-10 08:50:33,913 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:33,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-10 08:50:33,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-10 08:50:33,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=10846, Unknown=0, NotChecked=0, Total=12882 [2018-11-10 08:50:33,915 INFO L87 Difference]: Start difference. First operand 2401 states and 2419 transitions. Second operand 93 states. [2018-11-10 08:50:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:36,301 INFO L93 Difference]: Finished difference Result 2136 states and 2147 transitions. [2018-11-10 08:50:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-11-10 08:50:36,302 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1918 [2018-11-10 08:50:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:36,305 INFO L225 Difference]: With dead ends: 2136 [2018-11-10 08:50:36,305 INFO L226 Difference]: Without dead ends: 2127 [2018-11-10 08:50:36,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3971 GetRequests, 3753 SyntacticMatches, 22 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15420 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=6135, Invalid=32871, Unknown=0, NotChecked=0, Total=39006 [2018-11-10 08:50:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2018-11-10 08:50:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2114. [2018-11-10 08:50:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2018-11-10 08:50:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2125 transitions. [2018-11-10 08:50:36,319 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2125 transitions. Word has length 1918 [2018-11-10 08:50:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:36,319 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 2125 transitions. [2018-11-10 08:50:36,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-10 08:50:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2125 transitions. [2018-11-10 08:50:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1925 [2018-11-10 08:50:36,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:36,335 INFO L375 BasicCegarLoop]: trace histogram [295, 274, 273, 273, 273, 273, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:36,335 INFO L424 AbstractCegarLoop]: === Iteration 70 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:36,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash 381188288, now seen corresponding path program 56 times [2018-11-10 08:50:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:36,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:50:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:36,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 237909 backedges. 63922 proven. 4227 refuted. 0 times theorem prover too weak. 169760 trivial. 0 not checked. [2018-11-10 08:50:38,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:38,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:38,254 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:38,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:38,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:38,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:38,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:50:38,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:50:38,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-10 08:50:38,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:50:38,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 237909 backedges. 62621 proven. 4205 refuted. 0 times theorem prover too weak. 171083 trivial. 0 not checked. [2018-11-10 08:50:40,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 237909 backedges. 62514 proven. 4312 refuted. 0 times theorem prover too weak. 171083 trivial. 0 not checked. [2018-11-10 08:50:42,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:42,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 31, 31] total 107 [2018-11-10 08:50:42,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:42,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-10 08:50:42,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-10 08:50:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2366, Invalid=8976, Unknown=0, NotChecked=0, Total=11342 [2018-11-10 08:50:42,267 INFO L87 Difference]: Start difference. First operand 2114 states and 2125 transitions. Second operand 77 states. [2018-11-10 08:50:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:43,838 INFO L93 Difference]: Finished difference Result 2281 states and 2294 transitions. [2018-11-10 08:50:43,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-10 08:50:43,839 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 1924 [2018-11-10 08:50:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:43,842 INFO L225 Difference]: With dead ends: 2281 [2018-11-10 08:50:43,842 INFO L226 Difference]: Without dead ends: 2281 [2018-11-10 08:50:43,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3966 GetRequests, 3793 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9049 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=7871, Invalid=22231, Unknown=0, NotChecked=0, Total=30102 [2018-11-10 08:50:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2018-11-10 08:50:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2265. [2018-11-10 08:50:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2265 states. [2018-11-10 08:50:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2278 transitions. [2018-11-10 08:50:43,856 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2278 transitions. Word has length 1924 [2018-11-10 08:50:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:43,857 INFO L481 AbstractCegarLoop]: Abstraction has 2265 states and 2278 transitions. [2018-11-10 08:50:43,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-10 08:50:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2278 transitions. [2018-11-10 08:50:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1931 [2018-11-10 08:50:43,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:43,872 INFO L375 BasicCegarLoop]: trace histogram [296, 275, 274, 274, 274, 274, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:43,872 INFO L424 AbstractCegarLoop]: === Iteration 71 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:43,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash 557669001, now seen corresponding path program 57 times [2018-11-10 08:50:43,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:43,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:50:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:43,874 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 239592 backedges. 35237 proven. 1555 refuted. 0 times theorem prover too weak. 202800 trivial. 0 not checked. [2018-11-10 08:50:45,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:45,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:45,326 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:45,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:45,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:45,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:45,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:50:45,335 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:50:45,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:50:45,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:50:45,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 239592 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 203154 trivial. 0 not checked. [2018-11-10 08:50:47,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 239592 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 203154 trivial. 0 not checked. [2018-11-10 08:50:48,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 75 [2018-11-10 08:50:48,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:48,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-10 08:50:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-10 08:50:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=4845, Unknown=0, NotChecked=0, Total=5700 [2018-11-10 08:50:48,518 INFO L87 Difference]: Start difference. First operand 2265 states and 2278 transitions. Second operand 53 states. [2018-11-10 08:50:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:50:50,438 INFO L93 Difference]: Finished difference Result 2600 states and 2619 transitions. [2018-11-10 08:50:50,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-10 08:50:50,439 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1930 [2018-11-10 08:50:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:50:50,441 INFO L225 Difference]: With dead ends: 2600 [2018-11-10 08:50:50,442 INFO L226 Difference]: Without dead ends: 2600 [2018-11-10 08:50:50,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3915 GetRequests, 3814 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1602, Invalid=8904, Unknown=0, NotChecked=0, Total=10506 [2018-11-10 08:50:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2018-11-10 08:50:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2564. [2018-11-10 08:50:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2018-11-10 08:50:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 2582 transitions. [2018-11-10 08:50:50,454 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 2582 transitions. Word has length 1930 [2018-11-10 08:50:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:50:50,455 INFO L481 AbstractCegarLoop]: Abstraction has 2564 states and 2582 transitions. [2018-11-10 08:50:50,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-10 08:50:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 2582 transitions. [2018-11-10 08:50:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2076 [2018-11-10 08:50:50,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:50:50,470 INFO L375 BasicCegarLoop]: trace histogram [319, 297, 296, 296, 296, 296, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:50:50,470 INFO L424 AbstractCegarLoop]: === Iteration 72 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:50:50,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:50:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash 783439287, now seen corresponding path program 58 times [2018-11-10 08:50:50,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:50:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:50,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:50:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:50:50,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:50:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 279007 backedges. 68768 proven. 7228 refuted. 0 times theorem prover too weak. 203011 trivial. 0 not checked. [2018-11-10 08:50:52,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:52,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:50:52,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:50:52,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:50:52,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:50:52,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:50:52,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:50:52,647 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:50:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:53,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 279007 backedges. 103160 proven. 1302 refuted. 0 times theorem prover too weak. 174545 trivial. 0 not checked. [2018-11-10 08:50:55,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:50:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 279007 backedges. 71627 proven. 4165 refuted. 0 times theorem prover too weak. 203215 trivial. 0 not checked. [2018-11-10 08:50:57,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:50:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 46, 46] total 119 [2018-11-10 08:50:57,701 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:50:57,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-10 08:50:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-10 08:50:57,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2220, Invalid=11822, Unknown=0, NotChecked=0, Total=14042 [2018-11-10 08:50:57,703 INFO L87 Difference]: Start difference. First operand 2564 states and 2582 transitions. Second operand 97 states. [2018-11-10 08:51:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:00,086 INFO L93 Difference]: Finished difference Result 2293 states and 2304 transitions. [2018-11-10 08:51:00,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-11-10 08:51:00,087 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 2075 [2018-11-10 08:51:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:00,089 INFO L225 Difference]: With dead ends: 2293 [2018-11-10 08:51:00,089 INFO L226 Difference]: Without dead ends: 2284 [2018-11-10 08:51:00,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4291 GetRequests, 4063 SyntacticMatches, 23 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16925 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6700, Invalid=35942, Unknown=0, NotChecked=0, Total=42642 [2018-11-10 08:51:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2018-11-10 08:51:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2271. [2018-11-10 08:51:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2018-11-10 08:51:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 2282 transitions. [2018-11-10 08:51:00,101 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 2282 transitions. Word has length 2075 [2018-11-10 08:51:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:00,101 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 2282 transitions. [2018-11-10 08:51:00,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-10 08:51:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2282 transitions. [2018-11-10 08:51:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2082 [2018-11-10 08:51:00,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:00,117 INFO L375 BasicCegarLoop]: trace histogram [320, 298, 297, 297, 297, 297, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:00,117 INFO L424 AbstractCegarLoop]: === Iteration 73 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:51:00,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1562308146, now seen corresponding path program 59 times [2018-11-10 08:51:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:51:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:00,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:00,118 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:51:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 280830 backedges. 73050 proven. 4626 refuted. 0 times theorem prover too weak. 203154 trivial. 0 not checked. [2018-11-10 08:51:02,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:02,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:51:02,288 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:51:02,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:51:02,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:02,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:51:02,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:51:02,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:51:02,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-10 08:51:02,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:51:02,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:51:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 280830 backedges. 71621 proven. 4603 refuted. 0 times theorem prover too weak. 204606 trivial. 0 not checked. [2018-11-10 08:51:04,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:51:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 280830 backedges. 71509 proven. 4715 refuted. 0 times theorem prover too weak. 204606 trivial. 0 not checked. [2018-11-10 08:51:06,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:51:06,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 32, 32] total 111 [2018-11-10 08:51:06,761 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:51:06,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-10 08:51:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-10 08:51:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2530, Invalid=9680, Unknown=0, NotChecked=0, Total=12210 [2018-11-10 08:51:06,762 INFO L87 Difference]: Start difference. First operand 2271 states and 2282 transitions. Second operand 80 states. [2018-11-10 08:51:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:08,495 INFO L93 Difference]: Finished difference Result 2444 states and 2457 transitions. [2018-11-10 08:51:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-10 08:51:08,495 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 2081 [2018-11-10 08:51:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:08,498 INFO L225 Difference]: With dead ends: 2444 [2018-11-10 08:51:08,498 INFO L226 Difference]: Without dead ends: 2444 [2018-11-10 08:51:08,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4285 GetRequests, 4105 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9867 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=8492, Invalid=24088, Unknown=0, NotChecked=0, Total=32580 [2018-11-10 08:51:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2018-11-10 08:51:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2428. [2018-11-10 08:51:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-11-10 08:51:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 2441 transitions. [2018-11-10 08:51:08,510 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 2441 transitions. Word has length 2081 [2018-11-10 08:51:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:08,511 INFO L481 AbstractCegarLoop]: Abstraction has 2428 states and 2441 transitions. [2018-11-10 08:51:08,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-10 08:51:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2441 transitions. [2018-11-10 08:51:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2088 [2018-11-10 08:51:08,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:08,529 INFO L375 BasicCegarLoop]: trace histogram [321, 299, 298, 298, 298, 298, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:08,529 INFO L424 AbstractCegarLoop]: === Iteration 74 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:51:08,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1051206551, now seen corresponding path program 60 times [2018-11-10 08:51:08,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:51:08,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:08,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:51:08,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:08,530 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:51:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 282659 backedges. 39965 proven. 1706 refuted. 0 times theorem prover too weak. 240988 trivial. 0 not checked. [2018-11-10 08:51:10,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:10,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:51:10,161 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:51:10,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:51:10,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:10,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:51:10,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:51:10,172 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:51:10,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:51:10,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:51:10,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:51:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 282659 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241241 trivial. 0 not checked. [2018-11-10 08:51:12,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:51:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 282659 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241241 trivial. 0 not checked. [2018-11-10 08:51:13,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:51:13,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 77 [2018-11-10 08:51:13,742 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:51:13,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-10 08:51:13,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-10 08:51:13,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=897, Invalid=5109, Unknown=0, NotChecked=0, Total=6006 [2018-11-10 08:51:13,744 INFO L87 Difference]: Start difference. First operand 2428 states and 2441 transitions. Second operand 54 states. [2018-11-10 08:51:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:15,563 INFO L93 Difference]: Finished difference Result 2775 states and 2794 transitions. [2018-11-10 08:51:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-10 08:51:15,563 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2087 [2018-11-10 08:51:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:15,567 INFO L225 Difference]: With dead ends: 2775 [2018-11-10 08:51:15,567 INFO L226 Difference]: Without dead ends: 2775 [2018-11-10 08:51:15,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4230 GetRequests, 4126 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2686 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1647, Invalid=9483, Unknown=0, NotChecked=0, Total=11130 [2018-11-10 08:51:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2018-11-10 08:51:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2739. [2018-11-10 08:51:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2739 states. [2018-11-10 08:51:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 2757 transitions. [2018-11-10 08:51:15,587 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 2757 transitions. Word has length 2087 [2018-11-10 08:51:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:15,588 INFO L481 AbstractCegarLoop]: Abstraction has 2739 states and 2757 transitions. [2018-11-10 08:51:15,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-10 08:51:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 2757 transitions. [2018-11-10 08:51:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2018-11-10 08:51:15,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:15,618 INFO L375 BasicCegarLoop]: trace histogram [345, 322, 321, 321, 321, 321, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:15,618 INFO L424 AbstractCegarLoop]: === Iteration 75 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:51:15,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:15,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1861775680, now seen corresponding path program 61 times [2018-11-10 08:51:15,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:51:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:15,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:51:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:15,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:51:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 327316 backedges. 78324 proven. 7901 refuted. 0 times theorem prover too weak. 241091 trivial. 0 not checked. [2018-11-10 08:51:18,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:18,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:51:18,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:51:18,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:51:18,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:18,089 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:51:18,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:18,095 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:51:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:18,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:51:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 327316 backedges. 117534 proven. 1430 refuted. 0 times theorem prover too weak. 208352 trivial. 0 not checked. [2018-11-10 08:51:20,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:51:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 327316 backedges. 81462 proven. 4561 refuted. 0 times theorem prover too weak. 241293 trivial. 0 not checked. [2018-11-10 08:51:23,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:51:23,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 48, 48] total 124 [2018-11-10 08:51:23,709 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:51:23,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-11-10 08:51:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-11-10 08:51:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2412, Invalid=12840, Unknown=0, NotChecked=0, Total=15252 [2018-11-10 08:51:23,710 INFO L87 Difference]: Start difference. First operand 2739 states and 2757 transitions. Second operand 101 states. [2018-11-10 08:51:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:26,327 INFO L93 Difference]: Finished difference Result 2456 states and 2467 transitions. [2018-11-10 08:51:26,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-11-10 08:51:26,328 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 2238 [2018-11-10 08:51:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:26,330 INFO L225 Difference]: With dead ends: 2456 [2018-11-10 08:51:26,330 INFO L226 Difference]: Without dead ends: 2447 [2018-11-10 08:51:26,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4623 GetRequests, 4385 SyntacticMatches, 24 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18500 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7290, Invalid=39150, Unknown=0, NotChecked=0, Total=46440 [2018-11-10 08:51:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2018-11-10 08:51:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2434. [2018-11-10 08:51:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2018-11-10 08:51:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2445 transitions. [2018-11-10 08:51:26,342 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2445 transitions. Word has length 2238 [2018-11-10 08:51:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:26,343 INFO L481 AbstractCegarLoop]: Abstraction has 2434 states and 2445 transitions. [2018-11-10 08:51:26,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-11-10 08:51:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2445 transitions. [2018-11-10 08:51:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2245 [2018-11-10 08:51:26,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:26,361 INFO L375 BasicCegarLoop]: trace histogram [346, 323, 322, 322, 322, 322, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:26,361 INFO L424 AbstractCegarLoop]: === Iteration 76 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:51:26,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2114277399, now seen corresponding path program 62 times [2018-11-10 08:51:26,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:51:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:26,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:26,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:51:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 329291 backedges. 83007 proven. 5043 refuted. 0 times theorem prover too weak. 241241 trivial. 0 not checked. [2018-11-10 08:51:28,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:28,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:51:28,824 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:51:28,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:51:28,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:28,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:51:28,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:51:28,829 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:51:29,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-10 08:51:29,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:51:29,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:51:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 329291 backedges. 81444 proven. 5019 refuted. 0 times theorem prover too weak. 242828 trivial. 0 not checked. [2018-11-10 08:51:31,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:51:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 329291 backedges. 81327 proven. 5136 refuted. 0 times theorem prover too weak. 242828 trivial. 0 not checked. [2018-11-10 08:51:34,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:51:34,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 33, 33] total 115 [2018-11-10 08:51:34,049 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:51:34,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-11-10 08:51:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-11-10 08:51:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2695, Invalid=10415, Unknown=0, NotChecked=0, Total=13110 [2018-11-10 08:51:34,051 INFO L87 Difference]: Start difference. First operand 2434 states and 2445 transitions. Second operand 83 states. [2018-11-10 08:51:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:35,864 INFO L93 Difference]: Finished difference Result 2613 states and 2626 transitions. [2018-11-10 08:51:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-10 08:51:35,864 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 2244 [2018-11-10 08:51:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:35,868 INFO L225 Difference]: With dead ends: 2613 [2018-11-10 08:51:35,868 INFO L226 Difference]: Without dead ends: 2613 [2018-11-10 08:51:35,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4616 GetRequests, 4429 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10723 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=9130, Invalid=26026, Unknown=0, NotChecked=0, Total=35156 [2018-11-10 08:51:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2018-11-10 08:51:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2597. [2018-11-10 08:51:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2597 states. [2018-11-10 08:51:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 2610 transitions. [2018-11-10 08:51:35,883 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 2610 transitions. Word has length 2244 [2018-11-10 08:51:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:35,884 INFO L481 AbstractCegarLoop]: Abstraction has 2597 states and 2610 transitions. [2018-11-10 08:51:35,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-11-10 08:51:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 2610 transitions. [2018-11-10 08:51:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2251 [2018-11-10 08:51:35,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:35,905 INFO L375 BasicCegarLoop]: trace histogram [347, 324, 323, 323, 323, 323, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:35,905 INFO L424 AbstractCegarLoop]: === Iteration 77 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:51:35,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:35,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1415669344, now seen corresponding path program 63 times [2018-11-10 08:51:35,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:51:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:35,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:51:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:35,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:51:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 331272 backedges. 46062 proven. 1864 refuted. 0 times theorem prover too weak. 283346 trivial. 0 not checked. [2018-11-10 08:51:37,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:37,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:51:37,919 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:51:37,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:51:37,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:37,919 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:51:37,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:51:37,926 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:51:38,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:51:38,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:51:38,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:51:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 331272 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284441 trivial. 0 not checked. [2018-11-10 08:51:40,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:51:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 331272 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284441 trivial. 0 not checked. [2018-11-10 08:51:42,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:51:42,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 26, 26] total 87 [2018-11-10 08:51:42,065 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:51:42,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-10 08:51:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-10 08:51:42,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=6665, Unknown=0, NotChecked=0, Total=7656 [2018-11-10 08:51:42,066 INFO L87 Difference]: Start difference. First operand 2597 states and 2610 transitions. Second operand 63 states. [2018-11-10 08:51:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:44,597 INFO L93 Difference]: Finished difference Result 2956 states and 2975 transitions. [2018-11-10 08:51:44,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-10 08:51:44,597 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 2250 [2018-11-10 08:51:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:44,601 INFO L225 Difference]: With dead ends: 2956 [2018-11-10 08:51:44,601 INFO L226 Difference]: Without dead ends: 2956 [2018-11-10 08:51:44,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4565 GetRequests, 4450 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3304 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1911, Invalid=11661, Unknown=0, NotChecked=0, Total=13572 [2018-11-10 08:51:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-11-10 08:51:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2920. [2018-11-10 08:51:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2018-11-10 08:51:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 2938 transitions. [2018-11-10 08:51:44,617 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 2938 transitions. Word has length 2250 [2018-11-10 08:51:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:44,618 INFO L481 AbstractCegarLoop]: Abstraction has 2920 states and 2938 transitions. [2018-11-10 08:51:44,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-10 08:51:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 2938 transitions. [2018-11-10 08:51:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2408 [2018-11-10 08:51:44,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:44,640 INFO L375 BasicCegarLoop]: trace histogram [372, 348, 347, 347, 347, 347, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:44,640 INFO L424 AbstractCegarLoop]: === Iteration 78 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:51:44,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1509466770, now seen corresponding path program 64 times [2018-11-10 08:51:44,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:51:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:44,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:51:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:44,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:51:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 381615 backedges. 88727 proven. 8604 refuted. 0 times theorem prover too weak. 284284 trivial. 0 not checked. [2018-11-10 08:51:47,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:47,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:51:47,417 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:51:47,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:51:47,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:47,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:51:47,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:47,426 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:51:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:47,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:51:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 381615 backedges. 133182 proven. 1564 refuted. 0 times theorem prover too weak. 246869 trivial. 0 not checked. [2018-11-10 08:51:50,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:51:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 381615 backedges. 92157 proven. 4975 refuted. 0 times theorem prover too weak. 284483 trivial. 0 not checked. [2018-11-10 08:51:53,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:51:53,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 50, 50] total 129 [2018-11-10 08:51:53,662 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:51:53,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-11-10 08:51:53,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-11-10 08:51:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2612, Invalid=13900, Unknown=0, NotChecked=0, Total=16512 [2018-11-10 08:51:53,663 INFO L87 Difference]: Start difference. First operand 2920 states and 2938 transitions. Second operand 105 states. [2018-11-10 08:51:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:56,942 INFO L93 Difference]: Finished difference Result 2625 states and 2636 transitions. [2018-11-10 08:51:56,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-11-10 08:51:56,942 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 2407 [2018-11-10 08:51:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:56,945 INFO L225 Difference]: With dead ends: 2625 [2018-11-10 08:51:56,945 INFO L226 Difference]: Without dead ends: 2616 [2018-11-10 08:51:56,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4967 GetRequests, 4719 SyntacticMatches, 25 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20145 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7905, Invalid=42495, Unknown=0, NotChecked=0, Total=50400 [2018-11-10 08:51:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2018-11-10 08:51:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2603. [2018-11-10 08:51:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2018-11-10 08:51:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 2614 transitions. [2018-11-10 08:51:56,959 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 2614 transitions. Word has length 2407 [2018-11-10 08:51:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:56,960 INFO L481 AbstractCegarLoop]: Abstraction has 2603 states and 2614 transitions. [2018-11-10 08:51:56,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-11-10 08:51:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 2614 transitions. [2018-11-10 08:51:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2414 [2018-11-10 08:51:56,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:56,981 INFO L375 BasicCegarLoop]: trace histogram [373, 349, 348, 348, 348, 348, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:56,981 INFO L424 AbstractCegarLoop]: === Iteration 79 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:51:56,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash 386019141, now seen corresponding path program 65 times [2018-11-10 08:51:56,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:51:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:56,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:56,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:51:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 383748 backedges. 93829 proven. 5478 refuted. 0 times theorem prover too weak. 284441 trivial. 0 not checked. [2018-11-10 08:51:59,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:59,744 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:51:59,744 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:51:59,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:51:59,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:51:59,744 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:51:59,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:51:59,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:52:00,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-10 08:52:00,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:52:00,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 383748 backedges. 92126 proven. 5453 refuted. 0 times theorem prover too weak. 286169 trivial. 0 not checked. [2018-11-10 08:52:02,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:52:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 383748 backedges. 92004 proven. 5575 refuted. 0 times theorem prover too weak. 286169 trivial. 0 not checked. [2018-11-10 08:52:05,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:52:05,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 34, 34] total 119 [2018-11-10 08:52:05,779 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:52:05,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-11-10 08:52:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-11-10 08:52:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=11181, Unknown=0, NotChecked=0, Total=14042 [2018-11-10 08:52:05,781 INFO L87 Difference]: Start difference. First operand 2603 states and 2614 transitions. Second operand 86 states. [2018-11-10 08:52:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:07,804 INFO L93 Difference]: Finished difference Result 2788 states and 2801 transitions. [2018-11-10 08:52:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-10 08:52:07,804 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 2413 [2018-11-10 08:52:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:52:07,807 INFO L225 Difference]: With dead ends: 2788 [2018-11-10 08:52:07,807 INFO L226 Difference]: Without dead ends: 2788 [2018-11-10 08:52:07,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4959 GetRequests, 4765 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11617 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9785, Invalid=28045, Unknown=0, NotChecked=0, Total=37830 [2018-11-10 08:52:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2018-11-10 08:52:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2772. [2018-11-10 08:52:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-11-10 08:52:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 2785 transitions. [2018-11-10 08:52:07,820 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 2785 transitions. Word has length 2413 [2018-11-10 08:52:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:52:07,821 INFO L481 AbstractCegarLoop]: Abstraction has 2772 states and 2785 transitions. [2018-11-10 08:52:07,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-11-10 08:52:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 2785 transitions. [2018-11-10 08:52:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2420 [2018-11-10 08:52:07,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:52:07,841 INFO L375 BasicCegarLoop]: trace histogram [374, 350, 349, 349, 349, 349, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:07,841 INFO L424 AbstractCegarLoop]: === Iteration 80 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:52:07,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash -94318386, now seen corresponding path program 66 times [2018-11-10 08:52:07,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:52:07,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:07,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:07,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:07,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:52:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 385887 backedges. 50966 proven. 2029 refuted. 0 times theorem prover too weak. 332892 trivial. 0 not checked. [2018-11-10 08:52:09,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:09,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:52:09,961 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:52:09,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:52:09,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:09,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:52:09,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:52:09,970 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:52:10,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:52:10,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:52:10,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 385887 backedges. 50820 proven. 1875 refuted. 0 times theorem prover too weak. 333192 trivial. 0 not checked. [2018-11-10 08:52:12,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:52:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 385887 backedges. 50820 proven. 1875 refuted. 0 times theorem prover too weak. 333192 trivial. 0 not checked. [2018-11-10 08:52:14,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:52:14,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 83 [2018-11-10 08:52:14,487 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:52:14,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-10 08:52:14,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-10 08:52:14,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=986, Invalid=5986, Unknown=0, NotChecked=0, Total=6972 [2018-11-10 08:52:14,488 INFO L87 Difference]: Start difference. First operand 2772 states and 2785 transitions. Second operand 58 states. [2018-11-10 08:52:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:16,834 INFO L93 Difference]: Finished difference Result 3143 states and 3162 transitions. [2018-11-10 08:52:16,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-10 08:52:16,834 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2419 [2018-11-10 08:52:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:52:16,838 INFO L225 Difference]: With dead ends: 3143 [2018-11-10 08:52:16,838 INFO L226 Difference]: Without dead ends: 3143 [2018-11-10 08:52:16,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4898 GetRequests, 4786 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3087 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1780, Invalid=11102, Unknown=0, NotChecked=0, Total=12882 [2018-11-10 08:52:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2018-11-10 08:52:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3107. [2018-11-10 08:52:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3107 states. [2018-11-10 08:52:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 3125 transitions. [2018-11-10 08:52:16,852 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 3125 transitions. Word has length 2419 [2018-11-10 08:52:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:52:16,853 INFO L481 AbstractCegarLoop]: Abstraction has 3107 states and 3125 transitions. [2018-11-10 08:52:16,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-10 08:52:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3125 transitions. [2018-11-10 08:52:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2583 [2018-11-10 08:52:16,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:52:16,876 INFO L375 BasicCegarLoop]: trace histogram [400, 375, 374, 374, 374, 374, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:16,876 INFO L424 AbstractCegarLoop]: === Iteration 81 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:52:16,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:16,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1624290967, now seen corresponding path program 67 times [2018-11-10 08:52:16,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:52:16,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:16,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:16,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:16,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:52:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 442378 backedges. 100013 proven. 9337 refuted. 0 times theorem prover too weak. 333028 trivial. 0 not checked. [2018-11-10 08:52:20,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:20,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:52:20,006 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:52:20,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:52:20,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:20,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:52:20,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:20,015 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:52:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:20,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 442378 backedges. 150158 proven. 1704 refuted. 0 times theorem prover too weak. 290516 trivial. 0 not checked. [2018-11-10 08:52:23,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:52:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 442378 backedges. 103748 proven. 5407 refuted. 0 times theorem prover too weak. 333223 trivial. 0 not checked. [2018-11-10 08:52:27,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:52:27,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 52, 52] total 134 [2018-11-10 08:52:27,084 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:52:27,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-11-10 08:52:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-11-10 08:52:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2820, Invalid=15002, Unknown=0, NotChecked=0, Total=17822 [2018-11-10 08:52:27,086 INFO L87 Difference]: Start difference. First operand 3107 states and 3125 transitions. Second operand 109 states. [2018-11-10 08:52:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:30,174 INFO L93 Difference]: Finished difference Result 2800 states and 2811 transitions. [2018-11-10 08:52:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-11-10 08:52:30,174 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 2582 [2018-11-10 08:52:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:52:30,177 INFO L225 Difference]: With dead ends: 2800 [2018-11-10 08:52:30,177 INFO L226 Difference]: Without dead ends: 2791 [2018-11-10 08:52:30,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5323 GetRequests, 5065 SyntacticMatches, 26 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21860 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8545, Invalid=45977, Unknown=0, NotChecked=0, Total=54522 [2018-11-10 08:52:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2018-11-10 08:52:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2778. [2018-11-10 08:52:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-11-10 08:52:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 2789 transitions. [2018-11-10 08:52:30,191 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 2789 transitions. Word has length 2582 [2018-11-10 08:52:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:52:30,192 INFO L481 AbstractCegarLoop]: Abstraction has 2778 states and 2789 transitions. [2018-11-10 08:52:30,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-11-10 08:52:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 2789 transitions. [2018-11-10 08:52:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2589 [2018-11-10 08:52:30,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:52:30,215 INFO L375 BasicCegarLoop]: trace histogram [401, 376, 375, 375, 375, 375, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:30,215 INFO L424 AbstractCegarLoop]: === Iteration 82 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:52:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash 631517998, now seen corresponding path program 68 times [2018-11-10 08:52:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:52:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:30,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:52:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 444675 backedges. 105552 proven. 5931 refuted. 0 times theorem prover too weak. 333192 trivial. 0 not checked. [2018-11-10 08:52:33,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:33,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:52:33,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:52:33,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:52:33,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:33,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:52:33,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:52:33,390 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:52:35,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-10 08:52:35,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:52:35,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 444675 backedges. 56841 proven. 2028 refuted. 0 times theorem prover too weak. 385806 trivial. 0 not checked. [2018-11-10 08:52:37,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:52:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 444675 backedges. 56841 proven. 2028 refuted. 0 times theorem prover too weak. 385806 trivial. 0 not checked. [2018-11-10 08:52:39,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:52:39,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 29, 29] total 95 [2018-11-10 08:52:39,699 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:52:39,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-11-10 08:52:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-11-10 08:52:39,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=7550, Unknown=0, NotChecked=0, Total=8930 [2018-11-10 08:52:39,700 INFO L87 Difference]: Start difference. First operand 2778 states and 2789 transitions. Second operand 88 states. [2018-11-10 08:52:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:42,242 INFO L93 Difference]: Finished difference Result 2978 states and 2992 transitions. [2018-11-10 08:52:42,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-11-10 08:52:42,242 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 2588 [2018-11-10 08:52:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:52:42,245 INFO L225 Difference]: With dead ends: 2978 [2018-11-10 08:52:42,245 INFO L226 Difference]: Without dead ends: 2978 [2018-11-10 08:52:42,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5315 GetRequests, 5121 SyntacticMatches, 21 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8689 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7161, Invalid=23289, Unknown=0, NotChecked=0, Total=30450 [2018-11-10 08:52:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2018-11-10 08:52:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2959. [2018-11-10 08:52:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2018-11-10 08:52:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 2973 transitions. [2018-11-10 08:52:42,259 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 2973 transitions. Word has length 2588 [2018-11-10 08:52:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:52:42,260 INFO L481 AbstractCegarLoop]: Abstraction has 2959 states and 2973 transitions. [2018-11-10 08:52:42,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-11-10 08:52:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 2973 transitions. [2018-11-10 08:52:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2601 [2018-11-10 08:52:42,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:52:42,283 INFO L375 BasicCegarLoop]: trace histogram [403, 378, 377, 377, 377, 377, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:42,283 INFO L424 AbstractCegarLoop]: === Iteration 83 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:52:42,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2032686670, now seen corresponding path program 69 times [2018-11-10 08:52:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:52:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:42,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:42,284 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:52:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 449287 backedges. 61282 proven. 2255 refuted. 0 times theorem prover too weak. 385750 trivial. 0 not checked. [2018-11-10 08:52:45,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:45,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:52:45,235 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:52:45,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:52:45,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:45,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:52:45,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:52:45,243 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:52:45,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:52:45,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:52:45,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 449287 backedges. 61053 proven. 7582 refuted. 0 times theorem prover too weak. 380652 trivial. 0 not checked. [2018-11-10 08:52:48,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:52:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 449287 backedges. 61053 proven. 7582 refuted. 0 times theorem prover too weak. 380652 trivial. 0 not checked. [2018-11-10 08:52:51,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:52:51,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 61, 61] total 94 [2018-11-10 08:52:51,092 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:52:51,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-11-10 08:52:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-11-10 08:52:51,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1742, Invalid=7000, Unknown=0, NotChecked=0, Total=8742 [2018-11-10 08:52:51,093 INFO L87 Difference]: Start difference. First operand 2959 states and 2973 transitions. Second operand 91 states. [2018-11-10 08:52:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:52,858 INFO L93 Difference]: Finished difference Result 3326 states and 3344 transitions. [2018-11-10 08:52:52,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-11-10 08:52:52,858 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 2600 [2018-11-10 08:52:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:52:52,862 INFO L225 Difference]: With dead ends: 3326 [2018-11-10 08:52:52,862 INFO L226 Difference]: Without dead ends: 3326 [2018-11-10 08:52:52,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5312 GetRequests, 5108 SyntacticMatches, 57 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7221 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4838, Invalid=17214, Unknown=0, NotChecked=0, Total=22052 [2018-11-10 08:52:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2018-11-10 08:52:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3306. [2018-11-10 08:52:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-11-10 08:52:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 3324 transitions. [2018-11-10 08:52:52,886 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 3324 transitions. Word has length 2600 [2018-11-10 08:52:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:52:52,887 INFO L481 AbstractCegarLoop]: Abstraction has 3306 states and 3324 transitions. [2018-11-10 08:52:52,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-11-10 08:52:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 3324 transitions. [2018-11-10 08:52:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2764 [2018-11-10 08:52:52,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:52:52,916 INFO L375 BasicCegarLoop]: trace histogram [429, 403, 402, 402, 402, 402, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:52,916 INFO L424 AbstractCegarLoop]: === Iteration 84 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:52:52,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:52,917 INFO L82 PathProgramCache]: Analyzing trace with hash 249487717, now seen corresponding path program 70 times [2018-11-10 08:52:52,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:52:52,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:52,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:52,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:52,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:52:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 510097 backedges. 112218 proven. 10100 refuted. 0 times theorem prover too weak. 387779 trivial. 0 not checked. [2018-11-10 08:52:56,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:56,469 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:52:56,469 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:52:56,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:52:56,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:56,469 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:52:56,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:56,478 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:52:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:57,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 510097 backedges. 168516 proven. 1850 refuted. 0 times theorem prover too weak. 339731 trivial. 0 not checked. [2018-11-10 08:53:00,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:53:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 510097 backedges. 116271 proven. 5857 refuted. 0 times theorem prover too weak. 387969 trivial. 0 not checked. [2018-11-10 08:53:04,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:53:04,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 54, 54] total 139 [2018-11-10 08:53:04,292 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:53:04,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-11-10 08:53:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-11-10 08:53:04,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3036, Invalid=16146, Unknown=0, NotChecked=0, Total=19182 [2018-11-10 08:53:04,294 INFO L87 Difference]: Start difference. First operand 3306 states and 3324 transitions. Second operand 113 states. [2018-11-10 08:53:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:07,578 INFO L93 Difference]: Finished difference Result 2981 states and 2992 transitions. [2018-11-10 08:53:07,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-11-10 08:53:07,579 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 2763 [2018-11-10 08:53:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:07,583 INFO L225 Difference]: With dead ends: 2981 [2018-11-10 08:53:07,583 INFO L226 Difference]: Without dead ends: 2972 [2018-11-10 08:53:07,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5691 GetRequests, 5423 SyntacticMatches, 27 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23645 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9210, Invalid=49596, Unknown=0, NotChecked=0, Total=58806 [2018-11-10 08:53:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-11-10 08:53:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2959. [2018-11-10 08:53:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2018-11-10 08:53:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 2970 transitions. [2018-11-10 08:53:07,601 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 2970 transitions. Word has length 2763 [2018-11-10 08:53:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:07,603 INFO L481 AbstractCegarLoop]: Abstraction has 2959 states and 2970 transitions. [2018-11-10 08:53:07,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-11-10 08:53:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 2970 transitions. [2018-11-10 08:53:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2770 [2018-11-10 08:53:07,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:07,638 INFO L375 BasicCegarLoop]: trace histogram [430, 404, 403, 403, 403, 403, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:07,639 INFO L424 AbstractCegarLoop]: === Iteration 85 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:53:07,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1579555068, now seen corresponding path program 71 times [2018-11-10 08:53:07,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:53:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:07,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:07,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:53:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 512564 backedges. 118212 proven. 6402 refuted. 0 times theorem prover too weak. 387950 trivial. 0 not checked. [2018-11-10 08:53:11,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:11,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:53:11,201 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:53:11,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:53:11,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:11,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:53:11,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:53:11,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:53:12,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-10 08:53:12,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:53:12,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 512564 backedges. 116211 proven. 6375 refuted. 0 times theorem prover too weak. 389978 trivial. 0 not checked. [2018-11-10 08:53:15,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:53:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 512564 backedges. 116079 proven. 6507 refuted. 0 times theorem prover too weak. 389978 trivial. 0 not checked. [2018-11-10 08:53:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:53:18,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 36, 36] total 127 [2018-11-10 08:53:18,745 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:53:18,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-11-10 08:53:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-11-10 08:53:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=12806, Unknown=0, NotChecked=0, Total=16002 [2018-11-10 08:53:18,747 INFO L87 Difference]: Start difference. First operand 2959 states and 2970 transitions. Second operand 92 states. [2018-11-10 08:53:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:20,968 INFO L93 Difference]: Finished difference Result 3156 states and 3169 transitions. [2018-11-10 08:53:20,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-11-10 08:53:20,969 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 2769 [2018-11-10 08:53:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:20,973 INFO L225 Difference]: With dead ends: 3156 [2018-11-10 08:53:20,974 INFO L226 Difference]: Without dead ends: 3156 [2018-11-10 08:53:20,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5681 GetRequests, 5473 SyntacticMatches, 1 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13519 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=11146, Invalid=32326, Unknown=0, NotChecked=0, Total=43472 [2018-11-10 08:53:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2018-11-10 08:53:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3140. [2018-11-10 08:53:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-11-10 08:53:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 3153 transitions. [2018-11-10 08:53:20,999 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 3153 transitions. Word has length 2769 [2018-11-10 08:53:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:21,001 INFO L481 AbstractCegarLoop]: Abstraction has 3140 states and 3153 transitions. [2018-11-10 08:53:21,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-11-10 08:53:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 3153 transitions. [2018-11-10 08:53:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2776 [2018-11-10 08:53:21,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:21,045 INFO L375 BasicCegarLoop]: trace histogram [431, 405, 404, 404, 404, 404, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:21,045 INFO L424 AbstractCegarLoop]: === Iteration 86 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:53:21,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 870488645, now seen corresponding path program 72 times [2018-11-10 08:53:21,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:53:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:53:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:21,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:53:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 515037 backedges. 63819 proven. 2380 refuted. 0 times theorem prover too weak. 448838 trivial. 0 not checked. [2018-11-10 08:53:23,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:23,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:53:23,797 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:53:23,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:53:23,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:23,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/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 08:53:23,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:53:23,806 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:53:24,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:53:24,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:53:24,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 515037 backedges. 63661 proven. 2187 refuted. 0 times theorem prover too weak. 449189 trivial. 0 not checked. [2018-11-10 08:53:26,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:53:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 515037 backedges. 63661 proven. 2187 refuted. 0 times theorem prover too weak. 449189 trivial. 0 not checked. [2018-11-10 08:53:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:53:29,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 89 [2018-11-10 08:53:29,656 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:53:29,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-10 08:53:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-10 08:53:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1071, Invalid=6939, Unknown=0, NotChecked=0, Total=8010 [2018-11-10 08:53:29,658 INFO L87 Difference]: Start difference. First operand 3140 states and 3153 transitions. Second operand 62 states. [2018-11-10 08:53:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:32,030 INFO L93 Difference]: Finished difference Result 3535 states and 3554 transitions. [2018-11-10 08:53:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-11-10 08:53:32,030 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2775 [2018-11-10 08:53:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:32,034 INFO L225 Difference]: With dead ends: 3535 [2018-11-10 08:53:32,034 INFO L226 Difference]: Without dead ends: 3535 [2018-11-10 08:53:32,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5614 GetRequests, 5494 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3508 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1901, Invalid=12861, Unknown=0, NotChecked=0, Total=14762 [2018-11-10 08:53:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2018-11-10 08:53:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3499. [2018-11-10 08:53:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3499 states. [2018-11-10 08:53:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 3517 transitions. [2018-11-10 08:53:32,052 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 3517 transitions. Word has length 2775 [2018-11-10 08:53:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:32,054 INFO L481 AbstractCegarLoop]: Abstraction has 3499 states and 3517 transitions. [2018-11-10 08:53:32,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-10 08:53:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 3517 transitions. [2018-11-10 08:53:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2951 [2018-11-10 08:53:32,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:32,102 INFO L375 BasicCegarLoop]: trace histogram [459, 432, 431, 431, 431, 431, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:32,102 INFO L424 AbstractCegarLoop]: === Iteration 87 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:53:32,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash 601929646, now seen corresponding path program 73 times [2018-11-10 08:53:32,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:53:32,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:32,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:53:32,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:32,104 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:53:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 585282 backedges. 125378 proven. 10893 refuted. 0 times theorem prover too weak. 449011 trivial. 0 not checked. [2018-11-10 08:53:36,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:36,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:53:36,024 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:53:36,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:53:36,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:36,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:53:36,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:36,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:53:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:36,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 585282 backedges. 188310 proven. 2002 refuted. 0 times theorem prover too weak. 394970 trivial. 0 not checked. [2018-11-10 08:53:40,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:53:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 585282 backedges. 129762 proven. 6325 refuted. 0 times theorem prover too weak. 449195 trivial. 0 not checked. [2018-11-10 08:53:44,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:53:44,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 56, 56] total 144 [2018-11-10 08:53:44,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:53:44,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-11-10 08:53:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-11-10 08:53:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3260, Invalid=17332, Unknown=0, NotChecked=0, Total=20592 [2018-11-10 08:53:44,688 INFO L87 Difference]: Start difference. First operand 3499 states and 3517 transitions. Second operand 117 states. [2018-11-10 08:53:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:53:48,141 INFO L93 Difference]: Finished difference Result 3168 states and 3179 transitions. [2018-11-10 08:53:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-11-10 08:53:48,141 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 2950 [2018-11-10 08:53:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:53:48,144 INFO L225 Difference]: With dead ends: 3168 [2018-11-10 08:53:48,144 INFO L226 Difference]: Without dead ends: 3159 [2018-11-10 08:53:48,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6071 GetRequests, 5793 SyntacticMatches, 28 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25500 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9900, Invalid=53352, Unknown=0, NotChecked=0, Total=63252 [2018-11-10 08:53:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2018-11-10 08:53:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 3146. [2018-11-10 08:53:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2018-11-10 08:53:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 3157 transitions. [2018-11-10 08:53:48,162 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 3157 transitions. Word has length 2950 [2018-11-10 08:53:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:53:48,163 INFO L481 AbstractCegarLoop]: Abstraction has 3146 states and 3157 transitions. [2018-11-10 08:53:48,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-11-10 08:53:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 3157 transitions. [2018-11-10 08:53:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2957 [2018-11-10 08:53:48,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:53:48,195 INFO L375 BasicCegarLoop]: trace histogram [460, 433, 432, 432, 432, 432, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:53:48,195 INFO L424 AbstractCegarLoop]: === Iteration 88 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:53:48,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:53:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash -796032507, now seen corresponding path program 74 times [2018-11-10 08:53:48,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:53:48,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:48,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:53:48,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:53:48,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:53:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:53:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 587925 backedges. 131845 proven. 6891 refuted. 0 times theorem prover too weak. 449189 trivial. 0 not checked. [2018-11-10 08:53:52,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:52,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:53:52,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:53:52,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:53:52,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:53:52,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:53:52,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:53:52,146 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:53:54,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-10 08:53:54,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:53:54,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:53:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 587925 backedges. 129686 proven. 6863 refuted. 0 times theorem prover too weak. 451376 trivial. 0 not checked. [2018-11-10 08:53:58,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:54:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 587925 backedges. 129549 proven. 7000 refuted. 0 times theorem prover too weak. 451376 trivial. 0 not checked. [2018-11-10 08:54:01,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:54:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 37, 37] total 131 [2018-11-10 08:54:01,824 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:54:01,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-11-10 08:54:01,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-11-10 08:54:01,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3365, Invalid=13665, Unknown=0, NotChecked=0, Total=17030 [2018-11-10 08:54:01,825 INFO L87 Difference]: Start difference. First operand 3146 states and 3157 transitions. Second operand 95 states. [2018-11-10 08:54:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:54:04,160 INFO L93 Difference]: Finished difference Result 3349 states and 3362 transitions. [2018-11-10 08:54:04,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-10 08:54:04,160 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 2956 [2018-11-10 08:54:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:54:04,163 INFO L225 Difference]: With dead ends: 3349 [2018-11-10 08:54:04,163 INFO L226 Difference]: Without dead ends: 3349 [2018-11-10 08:54:04,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6060 GetRequests, 5845 SyntacticMatches, 1 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14527 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=11852, Invalid=34588, Unknown=0, NotChecked=0, Total=46440 [2018-11-10 08:54:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2018-11-10 08:54:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3333. [2018-11-10 08:54:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2018-11-10 08:54:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 3346 transitions. [2018-11-10 08:54:04,179 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 3346 transitions. Word has length 2956 [2018-11-10 08:54:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:54:04,180 INFO L481 AbstractCegarLoop]: Abstraction has 3333 states and 3346 transitions. [2018-11-10 08:54:04,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-11-10 08:54:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 3346 transitions. [2018-11-10 08:54:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2963 [2018-11-10 08:54:04,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:54:04,210 INFO L375 BasicCegarLoop]: trace histogram [461, 434, 433, 433, 433, 433, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:54:04,210 INFO L424 AbstractCegarLoop]: === Iteration 89 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:54:04,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:54:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2137937138, now seen corresponding path program 75 times [2018-11-10 08:54:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:54:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:04,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:54:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:04,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:54:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:54:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 590574 backedges. 71444 proven. 2566 refuted. 0 times theorem prover too weak. 516564 trivial. 0 not checked. [2018-11-10 08:54:07,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:07,382 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:54:07,383 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:54:07,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:54:07,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:07,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:54:07,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:54:07,388 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:54:08,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:54:08,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:54:08,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:54:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 590574 backedges. 70821 proven. 2352 refuted. 0 times theorem prover too weak. 517401 trivial. 0 not checked. [2018-11-10 08:54:10,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:54:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 590574 backedges. 70821 proven. 2352 refuted. 0 times theorem prover too weak. 517401 trivial. 0 not checked. [2018-11-10 08:54:13,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:54:13,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 95 [2018-11-10 08:54:13,968 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:54:13,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-10 08:54:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-10 08:54:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=7993, Unknown=0, NotChecked=0, Total=9120 [2018-11-10 08:54:13,969 INFO L87 Difference]: Start difference. First operand 3333 states and 3346 transitions. Second operand 67 states. [2018-11-10 08:54:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:54:16,549 INFO L93 Difference]: Finished difference Result 3740 states and 3759 transitions. [2018-11-10 08:54:16,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-10 08:54:16,549 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 2962 [2018-11-10 08:54:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:54:16,553 INFO L225 Difference]: With dead ends: 3740 [2018-11-10 08:54:16,553 INFO L226 Difference]: Without dead ends: 3740 [2018-11-10 08:54:16,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5993 GetRequests, 5866 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2053, Invalid=14459, Unknown=0, NotChecked=0, Total=16512 [2018-11-10 08:54:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2018-11-10 08:54:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3704. [2018-11-10 08:54:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3704 states. [2018-11-10 08:54:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 3722 transitions. [2018-11-10 08:54:16,570 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 3722 transitions. Word has length 2962 [2018-11-10 08:54:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:54:16,571 INFO L481 AbstractCegarLoop]: Abstraction has 3704 states and 3722 transitions. [2018-11-10 08:54:16,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-10 08:54:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 3722 transitions. [2018-11-10 08:54:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3144 [2018-11-10 08:54:16,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:54:16,620 INFO L375 BasicCegarLoop]: trace histogram [490, 462, 461, 461, 461, 461, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:54:16,620 INFO L424 AbstractCegarLoop]: === Iteration 90 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:54:16,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:54:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash 822583708, now seen corresponding path program 76 times [2018-11-10 08:54:16,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:54:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:16,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:54:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:16,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:54:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:54:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 668461 backedges. 139529 proven. 11716 refuted. 0 times theorem prover too weak. 517216 trivial. 0 not checked. [2018-11-10 08:54:21,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:21,021 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:54:21,022 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:54:21,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:54:21,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:21,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:54:21,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:54:21,031 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:54:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:54:21,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:54:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 668461 backedges. 209594 proven. 2160 refuted. 0 times theorem prover too weak. 456707 trivial. 0 not checked. [2018-11-10 08:54:25,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:54:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 668461 backedges. 144257 proven. 6811 refuted. 0 times theorem prover too weak. 517393 trivial. 0 not checked. [2018-11-10 08:54:30,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:54:30,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 58, 58] total 149 [2018-11-10 08:54:30,567 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:54:30,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-11-10 08:54:30,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-11-10 08:54:30,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3492, Invalid=18560, Unknown=0, NotChecked=0, Total=22052 [2018-11-10 08:54:30,569 INFO L87 Difference]: Start difference. First operand 3704 states and 3722 transitions. Second operand 121 states. [2018-11-10 08:54:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:54:34,331 INFO L93 Difference]: Finished difference Result 3361 states and 3372 transitions. [2018-11-10 08:54:34,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-11-10 08:54:34,331 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 3143 [2018-11-10 08:54:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:54:34,336 INFO L225 Difference]: With dead ends: 3361 [2018-11-10 08:54:34,336 INFO L226 Difference]: Without dead ends: 3352 [2018-11-10 08:54:34,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6463 GetRequests, 6175 SyntacticMatches, 29 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27425 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10615, Invalid=57245, Unknown=0, NotChecked=0, Total=67860 [2018-11-10 08:54:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2018-11-10 08:54:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3339. [2018-11-10 08:54:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2018-11-10 08:54:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 3350 transitions. [2018-11-10 08:54:34,353 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 3350 transitions. Word has length 3143 [2018-11-10 08:54:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:54:34,355 INFO L481 AbstractCegarLoop]: Abstraction has 3339 states and 3350 transitions. [2018-11-10 08:54:34,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-11-10 08:54:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 3350 transitions. [2018-11-10 08:54:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3150 [2018-11-10 08:54:34,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:54:34,389 INFO L375 BasicCegarLoop]: trace histogram [491, 463, 462, 462, 462, 462, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:54:34,390 INFO L424 AbstractCegarLoop]: === Iteration 91 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:54:34,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:54:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1129025267, now seen corresponding path program 77 times [2018-11-10 08:54:34,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:54:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:34,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:54:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:34,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:54:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:54:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 671286 backedges. 146487 proven. 7398 refuted. 0 times theorem prover too weak. 517401 trivial. 0 not checked. [2018-11-10 08:54:38,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:38,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:54:38,825 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:54:38,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:54:38,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:38,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:54:38,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:54:38,834 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:54:41,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-10 08:54:41,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:54:41,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:54:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 671286 backedges. 144164 proven. 7369 refuted. 0 times theorem prover too weak. 519753 trivial. 0 not checked. [2018-11-10 08:54:45,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:54:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 671286 backedges. 144022 proven. 7511 refuted. 0 times theorem prover too weak. 519753 trivial. 0 not checked. [2018-11-10 08:54:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:54:49,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 38, 38] total 135 [2018-11-10 08:54:49,308 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:54:49,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-10 08:54:49,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-10 08:54:49,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3535, Invalid=14555, Unknown=0, NotChecked=0, Total=18090 [2018-11-10 08:54:49,310 INFO L87 Difference]: Start difference. First operand 3339 states and 3350 transitions. Second operand 98 states. [2018-11-10 08:54:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:54:51,831 INFO L93 Difference]: Finished difference Result 3548 states and 3561 transitions. [2018-11-10 08:54:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-10 08:54:51,831 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 3149 [2018-11-10 08:54:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:54:51,835 INFO L225 Difference]: With dead ends: 3548 [2018-11-10 08:54:51,835 INFO L226 Difference]: Without dead ends: 3548 [2018-11-10 08:54:51,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6451 GetRequests, 6229 SyntacticMatches, 1 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15573 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=12575, Invalid=36931, Unknown=0, NotChecked=0, Total=49506 [2018-11-10 08:54:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-11-10 08:54:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3532. [2018-11-10 08:54:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-11-10 08:54:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 3545 transitions. [2018-11-10 08:54:51,851 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 3545 transitions. Word has length 3149 [2018-11-10 08:54:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:54:51,852 INFO L481 AbstractCegarLoop]: Abstraction has 3532 states and 3545 transitions. [2018-11-10 08:54:51,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-10 08:54:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 3545 transitions. [2018-11-10 08:54:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3156 [2018-11-10 08:54:51,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:54:51,886 INFO L375 BasicCegarLoop]: trace histogram [492, 464, 463, 463, 463, 463, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:54:51,886 INFO L424 AbstractCegarLoop]: === Iteration 92 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:54:51,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:54:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash -279166980, now seen corresponding path program 78 times [2018-11-10 08:54:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:54:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:51,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:54:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:54:51,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:54:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:54:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 674117 backedges. 78668 proven. 2759 refuted. 0 times theorem prover too weak. 592690 trivial. 0 not checked. [2018-11-10 08:54:55,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:55,495 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:54:55,495 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:54:55,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:54:55,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:54:55,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:54:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:54:55,504 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:54:56,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:54:56,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:54:56,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:54:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 674117 backedges. 78498 proven. 2523 refuted. 0 times theorem prover too weak. 593096 trivial. 0 not checked. [2018-11-10 08:54:59,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:55:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 674117 backedges. 78498 proven. 2523 refuted. 0 times theorem prover too weak. 593096 trivial. 0 not checked. [2018-11-10 08:55:02,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:55:02,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 31] total 95 [2018-11-10 08:55:02,944 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:55:02,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-10 08:55:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-10 08:55:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1152, Invalid=7968, Unknown=0, NotChecked=0, Total=9120 [2018-11-10 08:55:02,946 INFO L87 Difference]: Start difference. First operand 3532 states and 3545 transitions. Second operand 66 states. [2018-11-10 08:55:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:55:05,407 INFO L93 Difference]: Finished difference Result 3951 states and 3970 transitions. [2018-11-10 08:55:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-10 08:55:05,407 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 3155 [2018-11-10 08:55:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:55:05,412 INFO L225 Difference]: With dead ends: 3951 [2018-11-10 08:55:05,412 INFO L226 Difference]: Without dead ends: 3951 [2018-11-10 08:55:05,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6378 GetRequests, 6250 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3949 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2010, Invalid=14760, Unknown=0, NotChecked=0, Total=16770 [2018-11-10 08:55:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2018-11-10 08:55:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3915. [2018-11-10 08:55:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3915 states. [2018-11-10 08:55:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 3933 transitions. [2018-11-10 08:55:05,430 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 3933 transitions. Word has length 3155 [2018-11-10 08:55:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:55:05,431 INFO L481 AbstractCegarLoop]: Abstraction has 3915 states and 3933 transitions. [2018-11-10 08:55:05,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-10 08:55:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 3933 transitions. [2018-11-10 08:55:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3343 [2018-11-10 08:55:05,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:55:05,468 INFO L375 BasicCegarLoop]: trace histogram [522, 493, 492, 492, 492, 492, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:55:05,468 INFO L424 AbstractCegarLoop]: === Iteration 93 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:55:05,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:55:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1056762747, now seen corresponding path program 79 times [2018-11-10 08:55:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:55:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:05,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:55:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:05,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:55:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:55:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 760180 backedges. 154707 proven. 12569 refuted. 0 times theorem prover too weak. 592904 trivial. 0 not checked. [2018-11-10 08:55:10,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:55:10,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:55:10,402 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:55:10,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:55:10,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:55:10,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:55:10,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:55:10,409 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:55:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:55:11,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:55:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760180 backedges. 232422 proven. 2324 refuted. 0 times theorem prover too weak. 525434 trivial. 0 not checked. [2018-11-10 08:55:15,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:55:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 760180 backedges. 159792 proven. 7315 refuted. 0 times theorem prover too weak. 593073 trivial. 0 not checked. [2018-11-10 08:55:20,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:55:20,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 60, 60] total 154 [2018-11-10 08:55:20,978 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:55:20,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-11-10 08:55:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-11-10 08:55:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3732, Invalid=19830, Unknown=0, NotChecked=0, Total=23562 [2018-11-10 08:55:20,980 INFO L87 Difference]: Start difference. First operand 3915 states and 3933 transitions. Second operand 125 states. [2018-11-10 08:55:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:55:25,130 INFO L93 Difference]: Finished difference Result 3560 states and 3571 transitions. [2018-11-10 08:55:25,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-11-10 08:55:25,130 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 3342 [2018-11-10 08:55:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:55:25,134 INFO L225 Difference]: With dead ends: 3560 [2018-11-10 08:55:25,134 INFO L226 Difference]: Without dead ends: 3551 [2018-11-10 08:55:25,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6867 GetRequests, 6569 SyntacticMatches, 30 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29420 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11355, Invalid=61275, Unknown=0, NotChecked=0, Total=72630 [2018-11-10 08:55:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-11-10 08:55:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3538. [2018-11-10 08:55:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3538 states. [2018-11-10 08:55:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 3549 transitions. [2018-11-10 08:55:25,152 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 3549 transitions. Word has length 3342 [2018-11-10 08:55:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:55:25,153 INFO L481 AbstractCegarLoop]: Abstraction has 3538 states and 3549 transitions. [2018-11-10 08:55:25,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-11-10 08:55:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 3549 transitions. [2018-11-10 08:55:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3349 [2018-11-10 08:55:25,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:55:25,190 INFO L375 BasicCegarLoop]: trace histogram [523, 494, 493, 493, 493, 493, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:55:25,190 INFO L424 AbstractCegarLoop]: === Iteration 94 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:55:25,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:55:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1516493980, now seen corresponding path program 80 times [2018-11-10 08:55:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:55:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:55:25,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:25,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:55:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:55:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 763193 backedges. 162174 proven. 7923 refuted. 0 times theorem prover too weak. 593096 trivial. 0 not checked. [2018-11-10 08:55:30,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:55:30,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:55:30,161 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:55:30,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:55:30,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:55:30,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:55:30,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:55:30,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:55:33,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-11-10 08:55:33,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:55:33,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:55:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 763193 backedges. 159681 proven. 7893 refuted. 0 times theorem prover too weak. 595619 trivial. 0 not checked. [2018-11-10 08:55:37,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:55:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 763193 backedges. 159534 proven. 8040 refuted. 0 times theorem prover too weak. 595619 trivial. 0 not checked. [2018-11-10 08:55:42,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:55:42,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 39, 39] total 139 [2018-11-10 08:55:42,001 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:55:42,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-11-10 08:55:42,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-11-10 08:55:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3706, Invalid=15476, Unknown=0, NotChecked=0, Total=19182 [2018-11-10 08:55:42,002 INFO L87 Difference]: Start difference. First operand 3538 states and 3549 transitions. Second operand 101 states. [2018-11-10 08:55:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:55:44,575 INFO L93 Difference]: Finished difference Result 3753 states and 3766 transitions. [2018-11-10 08:55:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-10 08:55:44,575 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 3348 [2018-11-10 08:55:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:55:44,580 INFO L225 Difference]: With dead ends: 3753 [2018-11-10 08:55:44,580 INFO L226 Difference]: Without dead ends: 3753 [2018-11-10 08:55:44,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6854 GetRequests, 6625 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16657 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=13315, Invalid=39355, Unknown=0, NotChecked=0, Total=52670 [2018-11-10 08:55:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2018-11-10 08:55:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3737. [2018-11-10 08:55:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3737 states. [2018-11-10 08:55:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 3750 transitions. [2018-11-10 08:55:44,599 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 3750 transitions. Word has length 3348 [2018-11-10 08:55:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:55:44,601 INFO L481 AbstractCegarLoop]: Abstraction has 3737 states and 3750 transitions. [2018-11-10 08:55:44,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-11-10 08:55:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 3750 transitions. [2018-11-10 08:55:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3355 [2018-11-10 08:55:44,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:55:44,640 INFO L375 BasicCegarLoop]: trace histogram [524, 495, 494, 494, 494, 494, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:55:44,640 INFO L424 AbstractCegarLoop]: === Iteration 95 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:55:44,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:55:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1342078309, now seen corresponding path program 81 times [2018-11-10 08:55:44,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:55:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:44,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:55:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:44,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:55:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:55:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 766212 backedges. 87057 proven. 2959 refuted. 0 times theorem prover too weak. 676196 trivial. 0 not checked. [2018-11-10 08:55:48,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:55:48,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:55:48,644 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:55:48,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:55:48,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:55:48,645 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:55:48,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:55:48,654 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:55:49,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:55:49,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:55:49,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:55:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 766212 backedges. 86710 proven. 2700 refuted. 0 times theorem prover too weak. 676802 trivial. 0 not checked. [2018-11-10 08:55:53,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:55:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 766212 backedges. 86710 proven. 2700 refuted. 0 times theorem prover too weak. 676802 trivial. 0 not checked. [2018-11-10 08:55:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:55:56,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32, 32] total 99 [2018-11-10 08:55:56,846 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:55:56,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-10 08:55:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-10 08:55:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=8705, Unknown=0, NotChecked=0, Total=9900 [2018-11-10 08:55:56,847 INFO L87 Difference]: Start difference. First operand 3737 states and 3750 transitions. Second operand 69 states. [2018-11-10 08:55:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:55:59,881 INFO L93 Difference]: Finished difference Result 4168 states and 4187 transitions. [2018-11-10 08:55:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-10 08:55:59,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 3354 [2018-11-10 08:55:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:55:59,886 INFO L225 Difference]: With dead ends: 4168 [2018-11-10 08:55:59,886 INFO L226 Difference]: Without dead ends: 4168 [2018-11-10 08:55:59,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6779 GetRequests, 6646 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4264 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2094, Invalid=15996, Unknown=0, NotChecked=0, Total=18090 [2018-11-10 08:55:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2018-11-10 08:55:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4132. [2018-11-10 08:55:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4132 states. [2018-11-10 08:55:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 4150 transitions. [2018-11-10 08:55:59,905 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 4150 transitions. Word has length 3354 [2018-11-10 08:55:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:55:59,906 INFO L481 AbstractCegarLoop]: Abstraction has 4132 states and 4150 transitions. [2018-11-10 08:55:59,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-10 08:55:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 4150 transitions. [2018-11-10 08:55:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3548 [2018-11-10 08:55:59,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:55:59,948 INFO L375 BasicCegarLoop]: trace histogram [555, 525, 524, 524, 524, 524, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:55:59,948 INFO L424 AbstractCegarLoop]: === Iteration 96 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:55:59,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:55:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -528605677, now seen corresponding path program 82 times [2018-11-10 08:55:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:55:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:59,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:55:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:55:59,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:56:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:56:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 861003 backedges. 170948 proven. 13452 refuted. 0 times theorem prover too weak. 676603 trivial. 0 not checked. [2018-11-10 08:56:05,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:56:05,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:56:05,403 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:56:05,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:56:05,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:56:05,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:56:05,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:56:05,408 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:56:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:56:06,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:56:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 861003 backedges. 256848 proven. 2494 refuted. 0 times theorem prover too weak. 601661 trivial. 0 not checked. [2018-11-10 08:56:11,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:56:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 861003 backedges. 176403 proven. 7837 refuted. 0 times theorem prover too weak. 676763 trivial. 0 not checked. [2018-11-10 08:56:16,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:56:16,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 62, 62] total 159 [2018-11-10 08:56:16,981 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:56:16,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-11-10 08:56:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-11-10 08:56:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=21142, Unknown=0, NotChecked=0, Total=25122 [2018-11-10 08:56:16,983 INFO L87 Difference]: Start difference. First operand 4132 states and 4150 transitions. Second operand 129 states. [2018-11-10 08:56:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:56:20,473 INFO L93 Difference]: Finished difference Result 3765 states and 3776 transitions. [2018-11-10 08:56:20,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-11-10 08:56:20,473 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 3547 [2018-11-10 08:56:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:56:20,478 INFO L225 Difference]: With dead ends: 3765 [2018-11-10 08:56:20,479 INFO L226 Difference]: Without dead ends: 3756 [2018-11-10 08:56:20,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7283 GetRequests, 6975 SyntacticMatches, 31 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31485 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=12120, Invalid=65442, Unknown=0, NotChecked=0, Total=77562 [2018-11-10 08:56:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2018-11-10 08:56:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3743. [2018-11-10 08:56:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2018-11-10 08:56:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 3754 transitions. [2018-11-10 08:56:20,501 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 3754 transitions. Word has length 3547 [2018-11-10 08:56:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:56:20,503 INFO L481 AbstractCegarLoop]: Abstraction has 3743 states and 3754 transitions. [2018-11-10 08:56:20,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-11-10 08:56:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 3754 transitions. [2018-11-10 08:56:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3554 [2018-11-10 08:56:20,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:56:20,551 INFO L375 BasicCegarLoop]: trace histogram [556, 526, 525, 525, 525, 525, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:56:20,551 INFO L424 AbstractCegarLoop]: === Iteration 97 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:56:20,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:56:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash -733015766, now seen corresponding path program 83 times [2018-11-10 08:56:20,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:56:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:56:20,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:56:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:56:20,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:56:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:56:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 864210 backedges. 178942 proven. 8466 refuted. 0 times theorem prover too weak. 676802 trivial. 0 not checked. [2018-11-10 08:56:26,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:56:26,052 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:56:26,053 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:56:26,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:56:26,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:56:26,053 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:56:26,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:56:26,062 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:56:31,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-10 08:56:31,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:56:31,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:56:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 864210 backedges. 176273 proven. 8435 refuted. 0 times theorem prover too weak. 679502 trivial. 0 not checked. [2018-11-10 08:56:35,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:56:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 864210 backedges. 176121 proven. 8587 refuted. 0 times theorem prover too weak. 679502 trivial. 0 not checked. [2018-11-10 08:56:40,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:56:40,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 40, 40] total 141 [2018-11-10 08:56:40,761 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:56:40,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-10 08:56:40,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-10 08:56:40,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3837, Invalid=15903, Unknown=0, NotChecked=0, Total=19740 [2018-11-10 08:56:40,763 INFO L87 Difference]: Start difference. First operand 3743 states and 3754 transitions. Second operand 104 states. [2018-11-10 08:56:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:56:43,345 INFO L93 Difference]: Finished difference Result 3964 states and 3977 transitions. [2018-11-10 08:56:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-10 08:56:43,346 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 3553 [2018-11-10 08:56:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:56:43,350 INFO L225 Difference]: With dead ends: 3964 [2018-11-10 08:56:43,350 INFO L226 Difference]: Without dead ends: 3964 [2018-11-10 08:56:43,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7269 GetRequests, 7033 SyntacticMatches, 3 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17492 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=13967, Invalid=41023, Unknown=0, NotChecked=0, Total=54990 [2018-11-10 08:56:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2018-11-10 08:56:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3948. [2018-11-10 08:56:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2018-11-10 08:56:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 3961 transitions. [2018-11-10 08:56:43,371 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 3961 transitions. Word has length 3553 [2018-11-10 08:56:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:56:43,372 INFO L481 AbstractCegarLoop]: Abstraction has 3948 states and 3961 transitions. [2018-11-10 08:56:43,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-10 08:56:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 3961 transitions. [2018-11-10 08:56:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3560 [2018-11-10 08:56:43,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:56:43,413 INFO L375 BasicCegarLoop]: trace histogram [557, 527, 526, 526, 526, 526, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:56:43,413 INFO L424 AbstractCegarLoop]: === Iteration 98 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:56:43,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:56:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash -427146765, now seen corresponding path program 84 times [2018-11-10 08:56:43,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:56:43,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:56:43,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:56:43,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:56:43,414 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:56:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:56:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 867423 backedges. 95657 proven. 3166 refuted. 0 times theorem prover too weak. 768600 trivial. 0 not checked. [2018-11-10 08:56:47,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:56:47,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:56:47,859 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:56:47,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:56:47,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:56:47,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:56:47,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:56:47,870 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 08:56:49,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:56:49,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:56:49,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:56:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 867423 backedges. 95475 proven. 2883 refuted. 0 times theorem prover too weak. 769065 trivial. 0 not checked. [2018-11-10 08:56:52,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:56:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 867423 backedges. 95475 proven. 2883 refuted. 0 times theorem prover too weak. 769065 trivial. 0 not checked. [2018-11-10 08:56:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:56:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33, 33] total 101 [2018-11-10 08:56:56,942 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:56:56,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-10 08:56:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-10 08:56:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=9073, Unknown=0, NotChecked=0, Total=10302 [2018-11-10 08:56:56,943 INFO L87 Difference]: Start difference. First operand 3948 states and 3961 transitions. Second operand 70 states. [2018-11-10 08:56:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:56:59,662 INFO L93 Difference]: Finished difference Result 4391 states and 4410 transitions. [2018-11-10 08:56:59,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-10 08:56:59,662 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 3559 [2018-11-10 08:56:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:56:59,668 INFO L225 Difference]: With dead ends: 4391 [2018-11-10 08:56:59,668 INFO L226 Difference]: Without dead ends: 4391 [2018-11-10 08:56:59,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7190 GetRequests, 7054 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4410 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2107, Invalid=16799, Unknown=0, NotChecked=0, Total=18906 [2018-11-10 08:56:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4391 states. [2018-11-10 08:56:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4391 to 4355. [2018-11-10 08:56:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2018-11-10 08:56:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 4373 transitions. [2018-11-10 08:56:59,689 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 4373 transitions. Word has length 3559 [2018-11-10 08:56:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:56:59,691 INFO L481 AbstractCegarLoop]: Abstraction has 4355 states and 4373 transitions. [2018-11-10 08:56:59,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-10 08:56:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 4373 transitions. [2018-11-10 08:56:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3759 [2018-11-10 08:56:59,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:56:59,739 INFO L375 BasicCegarLoop]: trace histogram [589, 558, 557, 557, 557, 557, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:56:59,739 INFO L424 AbstractCegarLoop]: === Iteration 99 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:56:59,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:56:59,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1729319652, now seen corresponding path program 85 times [2018-11-10 08:56:59,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:56:59,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:56:59,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:56:59,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:56:59,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 971512 backedges. 188288 proven. 14365 refuted. 0 times theorem prover too weak. 768859 trivial. 0 not checked. [2018-11-10 08:57:06,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:06,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:06,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:57:06,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 08:57:06,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:06,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:06,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:06,037 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:06,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 971512 backedges. 282926 proven. 2670 refuted. 0 times theorem prover too weak. 685916 trivial. 0 not checked. [2018-11-10 08:57:12,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 971512 backedges. 194126 proven. 8377 refuted. 0 times theorem prover too weak. 769009 trivial. 0 not checked. [2018-11-10 08:57:18,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:57:18,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 64, 64] total 164 [2018-11-10 08:57:18,924 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:57:18,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-11-10 08:57:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-11-10 08:57:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4236, Invalid=22496, Unknown=0, NotChecked=0, Total=26732 [2018-11-10 08:57:18,925 INFO L87 Difference]: Start difference. First operand 4355 states and 4373 transitions. Second operand 133 states. [2018-11-10 08:57:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:24,085 INFO L93 Difference]: Finished difference Result 3976 states and 3987 transitions. [2018-11-10 08:57:24,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-11-10 08:57:24,085 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 3758 [2018-11-10 08:57:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:24,089 INFO L225 Difference]: With dead ends: 3976 [2018-11-10 08:57:24,089 INFO L226 Difference]: Without dead ends: 3967 [2018-11-10 08:57:24,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7711 GetRequests, 7393 SyntacticMatches, 32 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33620 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=12910, Invalid=69746, Unknown=0, NotChecked=0, Total=82656 [2018-11-10 08:57:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2018-11-10 08:57:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3954. [2018-11-10 08:57:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3954 states. [2018-11-10 08:57:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 3965 transitions. [2018-11-10 08:57:24,107 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 3965 transitions. Word has length 3758 [2018-11-10 08:57:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:24,108 INFO L481 AbstractCegarLoop]: Abstraction has 3954 states and 3965 transitions. [2018-11-10 08:57:24,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-11-10 08:57:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 3965 transitions. [2018-11-10 08:57:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3765 [2018-11-10 08:57:24,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:24,154 INFO L375 BasicCegarLoop]: trace histogram [590, 559, 558, 558, 558, 558, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:24,154 INFO L424 AbstractCegarLoop]: === Iteration 100 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:57:24,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash -638311693, now seen corresponding path program 86 times [2018-11-10 08:57:24,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:24,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:24,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 974919 backedges. 196827 proven. 9027 refuted. 0 times theorem prover too weak. 769065 trivial. 0 not checked. [2018-11-10 08:57:30,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:30,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:30,322 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:57:30,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:57:30,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:30,323 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:30,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:57:30,334 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:57:33,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-10 08:57:33,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:57:33,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 974919 backedges. 193976 proven. 8995 refuted. 0 times theorem prover too weak. 771948 trivial. 0 not checked. [2018-11-10 08:57:38,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 974919 backedges. 193819 proven. 9152 refuted. 0 times theorem prover too weak. 771948 trivial. 0 not checked. [2018-11-10 08:57:43,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:57:43,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 41, 41] total 142 [2018-11-10 08:57:43,857 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:57:43,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-11-10 08:57:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-11-10 08:57:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3964, Invalid=16058, Unknown=0, NotChecked=0, Total=20022 [2018-11-10 08:57:43,860 INFO L87 Difference]: Start difference. First operand 3954 states and 3965 transitions. Second operand 107 states. [2018-11-10 08:57:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:47,068 INFO L93 Difference]: Finished difference Result 4181 states and 4194 transitions. [2018-11-10 08:57:47,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-11-10 08:57:47,068 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 3764 [2018-11-10 08:57:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:47,074 INFO L225 Difference]: With dead ends: 4181 [2018-11-10 08:57:47,075 INFO L226 Difference]: Without dead ends: 4181 [2018-11-10 08:57:47,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7696 GetRequests, 7453 SyntacticMatches, 6 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18963 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=14033, Invalid=42849, Unknown=0, NotChecked=0, Total=56882 [2018-11-10 08:57:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2018-11-10 08:57:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4165. [2018-11-10 08:57:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4165 states. [2018-11-10 08:57:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 4178 transitions. [2018-11-10 08:57:47,097 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 4178 transitions. Word has length 3764 [2018-11-10 08:57:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:47,099 INFO L481 AbstractCegarLoop]: Abstraction has 4165 states and 4178 transitions. [2018-11-10 08:57:47,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-11-10 08:57:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 4178 transitions. [2018-11-10 08:57:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3771 [2018-11-10 08:57:47,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:47,148 INFO L375 BasicCegarLoop]: trace histogram [591, 560, 559, 559, 559, 559, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:47,149 INFO L424 AbstractCegarLoop]: === Iteration 101 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 08:57:47,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash 857074556, now seen corresponding path program 87 times [2018-11-10 08:57:47,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:47,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:57:47,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:58:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:58:04,699 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 08:58:04,739 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,740 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,740 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,740 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,740 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,741 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,743 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,743 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,743 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,743 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,743 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,744 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,744 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,744 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,744 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,745 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,745 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,745 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,745 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,745 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,748 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,748 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,749 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,749 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,749 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,749 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,749 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,750 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,750 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,750 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,750 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,750 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,751 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,751 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,754 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,754 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,754 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,755 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,755 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,755 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,755 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,755 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,756 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,756 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,756 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,756 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,756 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,757 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,759 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,760 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,760 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,760 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,760 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,760 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,761 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,761 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,761 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,761 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,761 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,761 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,762 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,762 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,764 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,764 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,764 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,765 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,765 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,765 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,765 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,765 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,765 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,765 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,766 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,766 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,766 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,766 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,770 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,772 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,778 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,779 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,780 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,782 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,783 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,784 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,787 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,788 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,791 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,792 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,795 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,795 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,795 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,797 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,797 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,797 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,800 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,800 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,801 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,801 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,801 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,801 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,801 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,801 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,801 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,802 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,802 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,802 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,802 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,802 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,805 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,805 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,805 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,805 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,805 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,806 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,806 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,806 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,806 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,806 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,806 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,806 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,807 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,807 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,810 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,810 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,810 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,810 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,810 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,810 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,811 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,816 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,816 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,816 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,816 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,817 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,818 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,818 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,821 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,821 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,821 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,821 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,822 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,822 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,822 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,822 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,822 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,822 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,822 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,823 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,823 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,823 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,826 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,826 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,827 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,827 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,827 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,827 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,827 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,827 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,827 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,828 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,828 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,828 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,828 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,828 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,833 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,833 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,833 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,833 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,833 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,834 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,835 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,839 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,839 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,839 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,839 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,839 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,839 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,840 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,844 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,845 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,845 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,845 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,845 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,845 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,845 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,845 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,847 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,847 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,848 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,848 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,848 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,848 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,852 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,853 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,853 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,853 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,853 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,853 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,853 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,853 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,854 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,854 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,854 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,854 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,854 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,854 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,858 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,859 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,859 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,859 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,859 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,859 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,859 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,859 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,860 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,860 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,860 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,860 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,860 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,860 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,865 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,865 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,865 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,865 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,865 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,865 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,866 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,871 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,871 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,872 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,872 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,872 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,872 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,872 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,872 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,872 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,873 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,873 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,873 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,873 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,873 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,878 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,878 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,878 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,879 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,879 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,879 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,879 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,879 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,879 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,879 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,880 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,880 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,880 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,880 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,885 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,886 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,886 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,886 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,886 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,886 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,886 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,886 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,887 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,887 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,887 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,887 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,887 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,887 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,895 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,895 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,895 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,895 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,895 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,896 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,896 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,896 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,896 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,896 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,896 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,896 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,897 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,897 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,902 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,904 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,904 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,904 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,904 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,904 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,904 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,910 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,910 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,910 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,910 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,910 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,911 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,912 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,919 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,919 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,919 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,919 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,919 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,920 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:04,921 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:58:05 BoogieIcfgContainer [2018-11-10 08:58:05,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:58:05,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:58:05,256 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:58:05,266 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:58:05,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:47:35" (3/4) ... [2018-11-10 08:58:05,268 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 08:58:05,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,289 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,290 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,291 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,292 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,293 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,294 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,294 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,294 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,294 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,294 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,294 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,295 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,296 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,296 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,296 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,296 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,296 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,296 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,297 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,298 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,298 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,298 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,298 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,298 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,300 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,301 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,302 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,302 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,302 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,303 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,304 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,305 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,306 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,306 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,307 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,308 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,308 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,308 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,309 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,310 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,311 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,311 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,311 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,312 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,313 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,315 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,315 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,316 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,317 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,317 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,317 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,317 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,318 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,318 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,318 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,318 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,320 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,322 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,322 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,322 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,322 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,326 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,327 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,327 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,327 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,327 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,328 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,328 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,328 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,328 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,329 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,331 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,332 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,332 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,332 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,332 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,332 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,332 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,333 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,334 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,335 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,336 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,337 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,338 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,339 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,339 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,339 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,340 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,342 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,342 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,342 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,345 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,345 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,345 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,345 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,348 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,348 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,348 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,348 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,348 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,349 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,372 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,373 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,373 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,373 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,375 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,376 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,376 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,376 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,376 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,376 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,378 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,397 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,397 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,397 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,397 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,397 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,397 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,397 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,398 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,398 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,398 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,398 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,398 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,398 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,400 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,400 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,400 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,400 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,400 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,400 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,401 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,401 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,401 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,401 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,420 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,420 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,420 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,420 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,422 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,423 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,424 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,424 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,426 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,426 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,426 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,426 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,426 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,444 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:58:05,741 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_91953a57-c10b-4317-9416-c7327c42a5f9/bin-2019/utaipan/witness.graphml [2018-11-10 08:58:05,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:58:05,742 INFO L168 Benchmark]: Toolchain (without parser) took 630766.07 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 958.1 MB in the beginning and 1.7 GB in the end (delta: -722.6 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-10 08:58:05,743 INFO L168 Benchmark]: CDTParser took 0.11 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 08:58:05,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.51 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:05,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:05,744 INFO L168 Benchmark]: Boogie Preprocessor took 18.87 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:58:05,744 INFO L168 Benchmark]: RCFGBuilder took 253.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:05,745 INFO L168 Benchmark]: TraceAbstraction took 629837.06 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -656.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-10 08:58:05,745 INFO L168 Benchmark]: Witness Printer took 485.37 ms. Allocated memory is still 5.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 82.3 MB). Peak memory consumption was 82.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:05,750 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.11 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 144.51 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.87 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 629837.06 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -656.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 485.37 ms. Allocated memory is still 5.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 82.3 MB). Peak memory consumption was 82.3 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: 18]: array index can be out of bounds array index can be out of bounds 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 + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [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) [L20] RET return i; [L27] EXPR foo(mask, i + 1) [L27] CALL b[i] = foo(mask, i + 1) [L27] RET b[i] = foo(mask, i + 1) [L26] i++ [L26] COND TRUE i < sizeof(mask) [L27] CALL foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] EXPR a[i] [L18] CALL, EXPR b[i] [L18] RET, EXPR b[i] [L18] a[i] = b[i] [L17] i++ [L17] COND TRUE i <= size [L18] a[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 8 error locations. UNSAFE Result, 629.7s OverallTime, 101 OverallIterations, 591 TraceHistogramMax, 138.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6775 SDtfs, 84085 SDslu, 119007 SDs, 0 SdLazy, 221178 SolverSat, 13836 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 272428 GetRequests, 260231 SyntacticMatches, 971 SemanticMatches, 11226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633847 ImplicationChecksByTransitivity, 189.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4355occurred in iteration=98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.2s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9273148148148148 AbsIntWeakeningRatio, 1.4444444444444444 AbsIntAvgWeakeningVarsNumRemoved, 91.38888888888889 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 100 MinimizatonAttempts, 2344 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 6.6s SsaConstructionTime, 60.2s SatisfiabilityAnalysisTime, 320.0s InterpolantComputationTime, 268700 NumberOfCodeBlocks, 241102 NumberOfCodeBlocksAsserted, 727 NumberOfCheckSat, 397022 ConstructedInterpolants, 42 QuantifiedInterpolants, 1351149870 SizeOfPredicates, 272 NumberOfNonLiveVariables, 359826 ConjunctsInSsa, 2953 ConjunctsInUnsatCore, 280 InterpolantComputations, 9 PerfectInterpolantSequences, 59887103/60571411 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...